The first author has recently proved that if f: X → Y is a k-dimensional map between compacta and Y is p-dimensional (0 ≤ k, p < ∞), then for each 0 ≤ i ≤ p + k, the set of maps g in the space $C(X,I^{p+2k+1-i})$ such that the diagonal product $f\times g:X\to Y\times I^{p+2k+1-i}$ is an (i+1)-to-1 map is a dense $G_{\delta }$-subset of $C(X,I^{p+2k+1-i})$. In this paper, we prove that if f: X → Y is as above and $D_j$ (j = 1,..., k) are superdendrites, then the set of maps h in $C(X,{\prod }_{j=1}^k{D}_j\times I^{p+1-i})$ such that $f\times h:X\to Y\times \left({\prod }_{j=1}^k{D}_j\times I^{p+1-i}\right)$ is (i+1)-to-1 is a dense $G_{\delta }$-subset of $C(X,{\prod }_{j=1}^k{D}_j\times I^{p+1-i})$ for each 0 ≤ i ≤ p.

Given a coarse space $(X,ℰ)$ with the bornology $ℬ$ of bounded subsets, we extend the coarse structure $ℰ$ from $X\times X$ to the natural coarse structure on $(ℬ\setminus \{\varnothing \left\}\right)\times (ℬ\setminus \{\varnothing \left\}\right)$ and say that a macro-uniform mapping $f:(ℬ\setminus \{\varnothing \left\}\right)\to X$ (or $f:{\left[X\right]}^2\to X$) is a selector (or 2-selector) of $(X,ℰ)$ if $f\left(A\right)\in A$ for each $A\in ℬ\setminus \left\{\varnothing \right\}$ ($A\in {\left[X\right]}^2$, respectively). We prove that a discrete coarse space $(X,ℰ)$ admits a selector if and only if $(X,ℰ)$ admits a 2-selector if and only if there exists a linear order “$\le$" on $X$ such that the family of intervals $\left\{\right[a,b]:a,b\in X,a\le b\}$ is a base for the bornology $ℬ$.

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...

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 ${\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...