English
Related papers

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

200 papers

Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…

Combinatorics · Mathematics 2019-11-20 Boris Bukh , Alfredo Hubard

Let $P_{d}(n)$ denote the number of $n \times \ldots \times n$ $d$-dimensional partitions with entries from $\left\{0,1,\ldots,n\right\}$. Building upon the works of Balogh-Treglown-Wagner and Noel-Scott-Sudakov, we show that when $d \to…

Combinatorics · Mathematics 2024-02-28 Cosmin Pohoata , Dmitriy Zakharov

Let $n$ be a positive integer. We provide an explicit geometrically motivated $1$-Lipschitz map from the space of persistence diagrams on $n$ points (equipped with the Bottleneck distance) into the Hilbert space $\ell^2$. Such maps are a…

Metric Geometry · Mathematics 2025-10-28 Atish Mitra , Ziga Virk

The commonly used spatial entropy $h_{r}(\mathcal{U})$ of the multi-dimensional shift space $\mathcal{U}$ is the limit of growth rate of admissible local patterns on finite rectangular sublattices which expands to whole space…

Dynamical Systems · Mathematics 2014-12-23 Wen-Guei Hu , Song-Sun Lin

Suppose that we have the unit Euclidean ball in $\R^n$ and construct new bodies using three operations - linear transformations, closure in the radial metric and multiplicative summation defined by $\|x\|_{K+_0L} = \sqrt{\|x\|_K\|x\|_L}.$…

Functional Analysis · Mathematics 2007-05-23 N. J. Kalton , A. Koldobsky , V. Yaskin , M. Yaskina

For each integer $\ell \geq 1$, we prove an unconditional upper bound on the size of the $\ell$-torsion subgroup of the class group, which holds for all but a zero-density set of field extensions of $\mathbb{Q}$ of degree $d$, for any fixed…

Number Theory · Mathematics 2018-03-16 Jordan Ellenberg , Lillian B. Pierce , Melanie Matchett Wood

We give two different and simple constructions for dimensionality reduction in $\ell_2$ via linear mappings that are sparse: only an $O(\varepsilon)$-fraction of entries in each column of our embedding matrices are non-zero to achieve…

Data Structures and Algorithms · Computer Science 2014-02-07 Daniel M. Kane , Jelani Nelson

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

Number Theory · Mathematics 2007-05-23 Ben Green

Here are two of our main results: Theorem 1. Let X be a normal space with dim X=n and m\geq n+1. Then the space C*(X,R^m) of all bounded maps from X into R^m equipped with the uniform convergence topology contains a dense G_{\delta}-subset…

General Topology · Mathematics 2015-06-26 Semeon Bogatyi , Vesko Valov

An encoder observes a point pattern---a finite number of points in the interval $[0,T]$---which is to be described to a reconstructor using bits. Based on these bits, the reconstructor wishes to select a subset of $[0,T]$ that contains all…

Information Theory · Computer Science 2011-02-16 Amos Lapidoth , Andreas Malär , Ligong Wang

For a family of interpolation norms $\| \cdot \|_{1,2,s}$ on $\mathbb{R}^n$, we provide a distribution over random matrices $\Phi_s \in \mathbb{R}^{m \times n}$ parametrized by sparsity level $s$ such that for a fixed set $X$ of $K$ points…

Data Structures and Algorithms · Computer Science 2015-06-03 Felix Krahmer , Rachel Ward

We study worst-case signal compression under an $\ell^2$ energy constraint, with coordinate-dependent quantization precisions. The compression problem is reduced to counting lattice points in a diagonal ellipsoid. Under balanced precision…

Information Theory · Computer Science 2026-04-06 A. Iosevich , A. Vagharshakyan , E. Wyman

Ordinal embedding aims at finding a low dimensional representation of objects from a set of constraints of the form "item $j$ is closer to item $i$ than item $k$". Typically, each object is mapped onto a point vector in a low dimensional…

Machine Learning · Computer Science 2021-05-26 Aïssatou Diallo , Johannes Fürnkranz

Let $X$ be Banach space which is not super-reflexive. Then, for each $n\ge1$ and $\varepsilon>0$, we exhibit metric embeddings of the Laakso graph $\mathcal{L}_n$ into $X$ with distortion less than $2+\varepsilon$ and into $L_1[0,1]$ with…

Functional Analysis · Mathematics 2022-03-17 S. J. Dilworth , Denka Kutzarova , Svetozar Stankov

The $L_p$-discrepancy is a quantitative measure for the irregularity of distribution of an $N$-element point set in the $d$-dimensional unit cube, which is closely related to the worst-case error of quasi-Monte Carlo algorithms for…

Numerical Analysis · Mathematics 2023-06-13 Erich Novak , Friedrich Pillichshammer

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

Computational Geometry · Computer Science 2017-11-16 Jakub Sosnovec

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…

Data Structures and Algorithms · Computer Science 2018-04-23 Arnold Filtser , Ofer Neiman

Let $f(n,\ell)$ be the maximum integer such that every set of $n$ points in the plane with at most $\ell$ collinear contains a subset of $f(n,\ell)$ points with no three collinear. First we prove that if $\ell \leq O(\sqrt{n})$ then…

Combinatorics · Mathematics 2016-02-09 Michael S. Payne , David R. Wood

The time decay of fully discrete finite-volume approximations of porous-medium and fast-diffusion equations with Neumann or periodic boundary conditions is proved in the entropy sense. The algebraic or exponential decay rates are computed…

Numerical Analysis · Mathematics 2013-03-18 Claire Chainais-Hillairet , Ansgar Jüngel , Stefan Schuchnigg

Bowen showed that a continuous expansive map with specification has a unique measure of maximal entropy. We show that the conclusion remains true under weaker non-uniform versions of these hypotheses. To this end, we introduce the notions…

Dynamical Systems · Mathematics 2019-02-20 Vaughn Climenhaga , Daniel J. Thompson