Related papers: A center transversal theorem for an improved Rado …

Given a collection of hypergraphs $\textbf{H}=(H_1,\ldots,H_m)$ with the same vertex set, an $m$-edge graph $F\subset \cup_{i\in [m]}H_i$ is a transversal if there is a bijection $\phi:E(F)\to [m]$ such that $e\in E(H_{\phi(e)})$ for each…

In this paper, we consider the essential spectrum of submanifolds in Euclidean spaces under various geometric hypotheses. Our results involve extrinsic conditions such as finite total mean curvature, the convergence of the gradient of the…

The metric dimension of a graph is the smallest number of nodes required to identify all other nodes based on shortest path distances uniquely. Applications of metric dimension include discovering the source of a spread in a network,…

An extension is given of a recent result of Glazyrin, showing that an orthonormal basis $\{e_{i}\}_{i=1}^{d}$ joined with the vectors $\{e_{j}\}_{j=1}^{m}$, where $1\leq m < d$ minimizes the $p$-frame potential for…

This paper presents an improved analysis of a structured dimension-reduction map called the subsampled randomized Hadamard transform. This argument demonstrates that the map preserves the Euclidean geometry of an entire subspace of vectors.…

In this paper and a companion paper, we prove that, if $m$ is sufficiently large, every graph on $m+1$ vertices that has a universal vertex and minimum degree at least $\lfloor \frac{2m}{3} \rfloor$ contains each tree $T$ with $m$ edges as…

Let $(M,g)$ be a compact, connected Riemannian manifold of dimension $n\ge 2$, and let $\{e_j\}_{j=0}^\infty$ be an orthonormal basis of Laplace eigenfunctions $-\Delta_g e_j=\lambda_j^2 e_j$. Given a finite Borel measure $\mu$ on $M$,…

We give a sufficient condition for a lightlike isotropic submanifold $M$, of dimension $n$, which is not totally geodesic in a semi-Riemannian manifold of constant curvature $c$ and of dimension $n+p (n < p)$, to admit a reduction of…

We show that, for vector spaces in which distance measurement is performed using a gauge, the existence of best coapproximations in $1$-codimensional closed linear subspaces implies in dimensions $\geq 2$ that the gauge is a norm, and in…

In this paper, we study complete self-shrinkers in Euclidean space and prove that an $n$-dimensional complete self-shrinker with polynomial volume growth in Euclidean space $\mathbb{R}^{n+1}$ is isometric to either $\mathbb{R}^{n}$,…

Let $\mathcal{P}$ be an $n$-point subset of Euclidean space and $d\geq 3$ be an integer. In this paper we study the following question: What is the smallest (normalized) relative change of the volume of subsets of $\mathcal{P}$ when it is…

We define a thin category $\mathrm{Dim}^+$ of dimension shifts and a category $\mathrm{RadMeas}$ of positive Radon measures with Radon--Nikodym density morphisms. We classify scaling-covariant functors $\mathrm{Dim}^+\to\mathrm{RadMeas}$…

Consider the principal $U(n)$ bundles over Grassmann manifolds $U(n)\rightarrow U(n+m)/U(m) \stackrel{\pi}\rightarrow G_{n,m}$. Given $X \in U_{m,n}(\mathbb{C})$ and a 2-dimensional subspace $\mathfrak{m}' \subset \mathfrak{m} $ $ \subset…

Erd\H{o}s, Pach, Pollack, and Tuza [\textit{J. Combin. Theory Ser. B, 47(1) (1989), 73-79}] proved that the diameter of a connected $n$-vertex graph with minimum degree $\delta$ is at most $\frac{3n}{\delta+1}+O(1)$. The oriented diameter…

The problem of recovering the configuration of points from their partial pairwise distances, referred to as the Euclidean Distance Matrix Completion (EDMC) problem, arises in a broad range of applications, including sensor network…

Let $N$ be a smooth $(n+l)$-dimensional Riemannian manifold. We show that if $V$ is an area-stationary union of three or more $C^{1,\mu}$ $n$-dimensional submanifolds-with-boundary $M_k \subset N$ with a common boundary $\Gamma$, then…

The problem of estimating, from a random sample of points, the dimension of a compact subset $S$ of the Euclidean space is considered. The emphasis is put on consistency results in the statistical sense. That is, statements of convergence…

We study shallow and deep neural networks whose inputs range over a general topological space. The model is built from a prescribed family of continuous feature maps and reduces to multilayer feedforward networks in the Euclidean case. We…

A set of vertices $S$ resolves a graph if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The metric dimension of a graph is the minimum cardinality of a resolving set of the graph. Fix a connected…

The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Given a finite metric space on n points, we seek its subspace of…