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

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

We show that any ${\Sigma }_s$-product of at most $𝔠$-many $L\Sigma (\le \omega )$-spaces has the $L\Sigma (\le \omega )$-property. This result generalizes some known results about $L\Sigma (\le \omega )$-spaces. On the other hand, we prove that every ${\Sigma }_s$-product of monotonically monolithic spaces is monotonically monolithic, and in a similar form, we show that every ${\Sigma }_s$-product of Collins-Roscoe spaces has the Collins-Roscoe property. These results generalize some known results about the Collins-Roscoe spaces and answer some questions due to Tkachuk [Lifting the Collins-Roscoe...

We investigate the recovery of $k$-sparse signals using the ${\ell }_1$-${\ell }_2$ minimization model with prior support set information. The prior support set information, which is believed to contain the indices of nonzero signal elements, significantly enhances the performance of compressive recovery by improving accuracy, efficiency, reducing complexity, expanding applicability, and enhancing robustness. We assume $k$-sparse signals $𝐱$ with the prior support $T$ which is composed of $g$ true indices and $b$ wrong...

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

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

In a Tychonoff space $X$, the point $p\in X$ is called a $C^{*}$-point if every real-valued continuous function on $C\setminus \left\{p\right\}$ can be extended continuously to $p$. Every point in an extremally disconnected space is a $C^{*}$-point. A classic example is the space ${𝐖}^{*}={\omega }_1+1$ consisting of the countable ordinals together with ${\omega }_1$. The point ${\omega }_1$ is known to be a $C^{*}$-point as well as a $P$-point. We supply a characterization of $C^{*}$-points in totally ordered spaces. The remainder of our time is aimed at studying when a point in a product space...

For $X,Y\in {𝐌}_{n,m}$ it is said that $X$ is gut-majorized by $Y$, and we write $X{\prec }_{\mathrm{gut}}Y$, if there exists an $n$-by-$n$ upper triangular g-row stochastic matrix $R$ such that $X=RY$. Define the relation ${\sim }_{\mathrm{gut}}$ as follows. $X{\sim }_{\mathrm{gut}}Y$ if $X$ is gut-majorized by $Y$ and $Y$ is gut-majorized by $X$. The (strong) linear preservers of ${\prec }_{\mathrm{gut}}$ on ${ℝ}^n$ and strong linear preservers of this relation on ${𝐌}_{n,m}$ have been characterized before. This paper characterizes all (strong) linear preservers and strong linear preservers of ${\sim }_{\mathrm{gut}}$ on ${ℝ}^n$ and ${𝐌}_{n,m}$.