English
Related papers

Related papers: Entropy-based Bounds on Dimension Reduction in L_1

200 papers

We prove that every $n$-point metric space of negative type (and, in particular, every $n$-point subset of $L_1$) embeds into a Euclidean space with distortion $O(\sqrt{\log n} \cdot\log \log n)$, a result which is tight up to the iterated…

Metric Geometry · Mathematics 2007-05-23 Sanjeev Arora , James R. Lee , Assaf Naor

We state an open problem in the theory of diversities: what is the worst case minimal distortion embedding of a diversity on $n$ points in $\ell_1$. This problem is the diversity analogue of a famous problem in metric geometry: what is the…

Metric Geometry · Mathematics 2017-12-07 David Bryant , Paul Tupper

We give an embedding of the Poincar\'e halfspace $H^D$ into a discrete metric space based on a binary tiling of $H^D$, with additive distortion $O(\log D)$. It yields the following results. We show that any subset $P$ of $n$ points in $H^D$…

Computational Geometry · Computer Science 2024-04-02 Eunku Park , Antoine Vigneron

According to a classical result of Szemer\'{e}di, every dense subset of $1,2,...,N$ contains an arbitrary long arithmetic progression, if $N$ is large enough. Its analogue in higher dimensions due to F\"urstenberg and Katznelson says that…

Combinatorics · Mathematics 2010-04-13 Adrian Dumitrescu

It is shown that for every $\e\in (0,1)$, every compact metric space $(X,d)$ has a compact subset $S\subseteq X$ that embeds into an ultrametric space with distortion $O(1/\e)$, and $$\dim_H(S)\ge (1-\e)\dim_H(X),$$ where $\dim_H(\cdot)$…

Metric Geometry · Mathematics 2013-03-26 Manor Mendel , Assaf Naor

The ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo and Willsky considers the maximum number $n$ random Gaussian points in $\mathbb{R}^d$, such that with high probability, there exists an origin-symmetric ellipsoid…

Probability · Mathematics 2023-07-25 Madhur Tulsiani , June Wu

We show that every codimension one partially hyperbolic diffeomorphism must support on $\mathbb{T}^{n}$. It is locally uniquely integrable and derived from a linear codimension one Anosov diffeomorphism. Moreover, this system is…

Dynamical Systems · Mathematics 2022-11-03 Xiang Zhang

In this short note, we prove a version of the Johnson-Lindenstrauss flattening Lemma for point sets taking values in discrete subgroups. More precisely, given $d,\lambda_0,N_0\in\mathbb{N}$ and $\epsilon\in \left(0,\frac{1}{2}\right)$…

Metric Geometry · Mathematics 2025-01-22 Rodolfo Viera

The $l_2$ flattening lemma of Johnson and Lindenstrauss [JL84] is a powerful tool for dimension reduction. It has been conjectured that the target dimension bounds can be refined and bounded in terms of the intrinsic dimensionality of the…

Computational Geometry · Computer Science 2015-06-09 Lee-Ad Gottlieb , Robert Krauthgamer

We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…

Classical Analysis and ODEs · Mathematics 2014-09-23 Michael Hochman

Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]^d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the…

Combinatorics · Mathematics 2025-06-24 Zichao Dong , Zijian Xu

We study the problem of $2$-dimensional orthogonal range counting with additive error. Given a set $P$ of $n$ points drawn from an $n\times n$ grid and an error parameter $\eps$, the goal is to build a data structure, such that for any…

Data Structures and Algorithms · Computer Science 2016-05-24 Zhewei Wei , Ke Yi

We show that any $L_1$ embedding of the transportation cost (a.k.a. Earthmover) metric on probability measures supported on the grid $\{0,1,...,n\}^2\subseteq \R^2$ incurs distortion $\Omega(\sqrt{\log n})$. We also use Fourier analytic…

Computational Geometry · Computer Science 2007-05-23 Assaf Naor , Gideon Schechtman

Let $V \subset \mathbb{R}$ be a finite set with $|V| = n $ and suppose we are given each pairwise distance independently with probability $p$. We show that if $p = (1+\epsilon)/n$, for some fixed $\epsilon >0$, then we can reconstruct a…

Combinatorics · Mathematics 2026-02-27 Julien Portier

In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…

Number Theory · Mathematics 2013-08-26 Christoph Aistleitner , Josef Dick

We study the embedding $\text{id}: \ell_p^b(\ell_q^d) \to \ell_r^b(\ell_u^d)$ and prove matching bounds for the entropy numbers $e_k(\text{id})$ provided that $0<p<r\leq \infty$ and $0<q\leq u\leq \infty$. Based on this finding, we…

Functional Analysis · Mathematics 2020-03-02 Sebastian Mayer , Tino Ullrich

We study a number of (3+1)- and (2+1)-dimensional defect and boundary conformal field theories holographically dual to supergravity theories. In all cases the defects or boundaries are planar, and the defects are codimension-one. Using…

High Energy Physics - Theory · Physics 2015-11-09 John Estes , Kristan Jensen , Andy O'Bannon , Efstratios Tsatis , Timm Wrase

Let A_N be an N-point distribution in the unit square in the Euclidean plane. We consider the Discrepancy function D_N(x) in two dimensions with respect to rectangles with lower left corner anchored at the origin and upper right corner at…

Number Theory · Mathematics 2013-10-14 Dmitriy Bilyk , Michael T. Lacey , Ioannis Parissis , Armen Vagharshakyan

It is known that if finite subsets of a locally finite metric space $M$ admit $C$-bilipschitz embeddings into $\ell_p$ $(1\le p\le \infty)$, then for every $\epsilon>0$, the space $M$ admits a $(C+\epsilon)$-bilipschitz embedding into…

Functional Analysis · Mathematics 2019-10-10 Sofiya Ostrovska , Mikhail I. Ostrovskii

Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…

Data Structures and Algorithms · Computer Science 2007-05-23 Yair Bartal , Manor Mendel