Related papers: Distance bounds for high dimensional consistent di…
The assumptions that "light propagates along null geodesics of the spacetime metric" and "the number of photons is conserved along the light path" lead to the distance duality relation (DDR), $\eta = D_L(z) (1 + z)^{-2}/D_A(z) = 1$, with…
In the work by M. C. Lee, A. Naber, and R. Neumayer a beautiful $\varepsilon$-regularity theorem is proved under small negative scalar curvature and entropy bounds. In that paper, the $d_p$ distance for Riemannian manifolds is introduced…
All parallel algorithms for directed reachability and shortest paths crucially rely on efficient shortcut constructions. These constructions find directed paths and shortcut them by adding edges, with the goal to reduce the diameter of the…
A set N is called a "weak epsilon-net" (with respect to convex sets) for a finite set X in R^d if N intersects every convex set that contains at least epsilon*|X| points of X. For every fixed d>=2 and every r>=1 we construct sets X in R^d…
The Johnson-Lindenstrauss transform is a fundamental method for dimension reduction in Euclidean spaces, that can map any dataset of $n$ points into dimension $O(\log n)$ with low distortion of their distances. This dimension bound is tight…
We construct quasiconformal mappings in Euclidean spaces by integration of a discontinuous kernel against doubling measures with suitable decay. The differentials of mappings that arise in this way satisfy an isotropic form of the doubling…
We study the family of vertical projections whose fibers are right cosets of horizontal planes in the Heisenberg group, $\mathbb{H}^n$. We prove lower bounds for Hausdorff dimension distortion of sets under these mappings, with respect to…
Recently, the first author together with Jens Marklof studied generalizations of the classical three distance theorem to higher dimensional toral rotations, giving upper bounds in all dimensions for the corresponding numbers of distances…
The Gromov-Hausdorff distance $(d_{GH})$ proves to be a useful distance measure between shapes. In order to approximate $d_{GH}$ for compact subsets $X,Y\subset\mathbb{R}^d$, we look into its relationship with $d_{H,iso}$, the infimum…
We generalize upper bounds for constant dimension codes containing a lifted maximum rank distance code first studied by Etzion and Silberstein. The proof allows to construct several improved codes.
Spanners for low dimensional spaces (e.g. Euclidean space of constant dimension, or doubling metrics) are well understood. This lies in contrast to the situation in high dimensional spaces, where except for the work of Har-Peled, Indyk and…
Sliced Wasserstein distances preserve properties of classic Wasserstein distances while being more scalable for computation and estimation in high dimensions. The goal of this work is to quantify this scalability from three key aspects: (i)…
In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclidean distance between points up to a bounded relative error.…
We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…
We study a finite-field analogue of the Erd\H{o}s distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let $\Delta(S)$ denote the set of Hamming distances determined by \(S\). We prove the lower bound…
The construction of $r$-nets offers a powerful tool in computational and metric geometry. We focus on high-dimensional spaces and present a new randomized algorithm which efficiently computes approximate $r$-nets with respect to Euclidean…
In the first paper of this series [S. Torquato, J. Chem. Phys. {\bf 136}, 054106 (2012)], analytical results concerning the continuum percolation of overlapping hyperparticles in $d$-dimensional Euclidean space $\mathbb{R}^d$ were obtained,…
Quantum correlations described by quantum discord and one-way quantum deficit can contain ordinary regions with {\em constant} (i.e., universal) optimal measurement angle $0$ or $\pi/2$ with respect to the $z$-axis and regions with a {\em…
Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combinatorial discrepancy. Depending on the ranges, several…
The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the…