We prove that for a normed linear space $X$, if $f_1:X\to ℝ$ is continuous and semiconvex with modulus $\omega$, $f_2:X\to ℝ$ is continuous and semiconcave with modulus $\omega$ and $f_1\le f_2$, then there exists $f\in C^{1,\omega }\left(X\right)$ such that $f_1\le f\le f_2$. Using this result we prove a generalization of Ilmanen lemma (which deals with the case $\omega \left(t\right)=t$) to the case of an arbitrary nontrivial modulus $\omega$. This generalization (where a $C_{loc}^{1,\omega }$ function is inserted) gives a positive answer to a problem formulated by A. Fathi and M. Zavidovique in 2010.

We prove some results in the context of isoperimetric inequalities with quantitative terms. In the $2$-dimensional case, our main contribution is a method for determining the optimal coefficients $c_1,...,c_m$ in the inequality $\delta P\left(E\right)\ge {\sum }_{k=1}^m{c}_k\alpha {\left(E\right)}^k+o\left(\alpha {\left(E\right)}^m\right)$, valid for each Borel set $E$ with positive and finite area, with $\delta P\left(E\right)$ and $\alpha \left(E\right)$ being, respectively, the $\mathrm{𝑖𝑠𝑜𝑝𝑒𝑟𝑖𝑚𝑒𝑡𝑟𝑖𝑐𝑑𝑒𝑓𝑖𝑐𝑖𝑡}$ and the $\mathrm{𝐹𝑟𝑎𝑒𝑛𝑘𝑒𝑙𝑎𝑠𝑦𝑚𝑚𝑒𝑡𝑟𝑦}$ of $E$. In $n$ dimensions, besides proving existence and regularity properties of minimizers for a wide class of $\mathrm{𝑞𝑢𝑎𝑛𝑡𝑖𝑡𝑎𝑡𝑖𝑣𝑒𝑖𝑠𝑜𝑝𝑒𝑟𝑖𝑚𝑒𝑡𝑟𝑖𝑐𝑞𝑢𝑜𝑡𝑖𝑒𝑛𝑡𝑠}$ including the lower semicontinuous extension of $\frac{\delta P\left(E\right)}{\alpha {\left(E\right)}^2}$, we...

Let $F$ be a closed subset of ${ℝ}^n$ and let $P\left(x\right)$ denote the metric projection (closest point mapping) of $x\in {ℝ}^n$ onto $F$ in $l^p$-norm. A classical result of Asplund states that $P$ is (Fréchet) differentiable almost everywhere (a.e.) in ${ℝ}^n$ in the Euclidean case $p=2$. We consider the case $2<p<\infty$ and prove that the $i$th component $P_i\left(x\right)$ of $P\left(x\right)$ is differentiable a.e. if $P_i\left(x\right)\ne x_i$ and satisfies Hölder condition of order $1/(p-1)$ if $P_i\left(x\right)=x_i$.

For a fixed positive integer $k$ and $G=(V,E)$ a connected graph of order $n$, whose minimum vertex degree is at least $k$, a set $S\subseteq V$ is a total $k$-dominating set, also known as a $k$-tuple total dominating set, if every vertex $v\in V$ has at least $k$ neighbors in $S$. The minimum size of a total $k$-dominating set for $G$ is called the total $k$-domination number of $G$, denoted by ${\gamma }_{kt}\left(G\right)$. The total $k$-domination problem is to determine a minimum total $k$-dominating set of $G$. Since the exact problem is in general quite difficult...

Let ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to d}$ be the following algorithmic problem: Given a finite simplicial complex $K$ of dimension at most $k$, does there exist a (piecewise linear) embedding of $K$ into ${ℝ}^d$? Known results easily imply polynomiality of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to 2}$ ($k=1,2$; the case $k=1,d=2$ is graph planarity) and of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to 2k}$ for all $k\ge 3$. We show that the celebrated result of Novikov on the algorithmic unsolvability of recognizing the 5-sphere implies that ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{d\to d}$ and ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{(d-1)\to d}$ are undecidable for each ${}_d\ge 5$. Our main result is NP-hardness of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{2\to 4}$ and, more generally, of ${\mathrm{𝙴𝙼𝙱𝙴𝙳}}_{k\to d}$ for all...

In this paper we prove the following theorems in incidence geometry. 1. There is $\delta >0$ such that for any $P_1,\cdots ,P_4$, and $Q_1,\cdots ,Q_n\in {ℂ}^2$, if there are $\le n^{(1+\delta )/2}$ many distinct lines between $P_i$ and $Q_j$ for all $i$, $j$, then $P_1,\cdots ,P_4$ are collinear. If the number of the distinct lines is $<c{n}^{1/2}$ then the cross ratio of the four points is algebraic. 2. Given $c>0$, there is $\delta >0$ such that for any $P_1,P_2,P_3\in {ℂ}^2$ noncollinear, and $Q_1,\cdots ,Q_n\in {ℂ}^2$, if there are $\le c{n}^{1/2}$ many distinct lines between $P_i$ and $Q_j$ for all $i$, $j$, then for any $P\in {ℂ}^2\setminus \{P_1,P_2,P_3\}$, we have $\delta n$ distinct lines between $P$ and $Q_j$. 3. Given...

Let $G_1$ and $G_2$ be two given graphs. The Ramsey number $R(G_1,G_2)$ is the least integer $r$ such that for every graph $G$ on $r$ vertices, either $G$ contains a $G_1$ or $\overline{G}$ contains a $G_2$. Parsons gave a recursive formula to determine the values of $R(P_n,K_{1,m})$, where $P_n$ is a path on $n$ vertices and $K_{1,m}$ is a star on $m+1$ vertices. In this note, we study the Ramsey numbers $R(P_n,K_1\vee F_m)$, where $F_m$ is a linear forest on $m$ vertices. We determine the exact values of $R(P_n,K_1\vee F_m)$ for the cases $m\le n$ and $m\ge 2n$, and for the case that $F_m$ has no odd component. Moreover, we...

Let $D$ be a ${𝒞}^d$ $q$-convex intersection, $d\ge 2$, $0\le q\le n-1$, in a complex manifold $X$ of complex dimension $n$, $n\ge 2$, and let $E$ be a holomorphic vector bundle of rank $N$ over $X$. In this paper, ${𝒞}^k$-estimates, $k=2,3,\cdots ,\infty$, for solutions to the $\overline{\partial }$-equation with small loss of smoothness are obtained for $E$-valued $(0,s)$-forms on $D$ when $n-q\le s\le n$. In addition, we solve the $\overline{\partial }$-equation with a support condition in ${𝒞}^k$-spaces. More precisely, we prove that for a $\overline{\partial }$-closed form $f$ in ${𝒞}_{0,q}^k(X\setminus D,E)$, $1\le q\le n-2$, $n\ge 3$, with compact support and for $\epsilon$ with $0<\epsilon <1$ there...

CONTENTSPREFACE..........................................................................................................................................................................3INTRODUCTION............................................................................................................................................................. 41. Notation. 2. Subject of the paper.Chapter I. DECOMPOSITION OF Σ INTO ${\Sigma }_1$, ${\Sigma }_2$, ${\Sigma }_3$, ${\Sigma }_4$ INESSENTIAL RESTRICTIONOF GENERALITY ...............................................................................................................................................................