English
Related papers

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

200 papers

Consider a set $X\subseteq \mathbb{R}^d$ which is 1-dense, namely, it intersects every unit ball. We show that we can get from any point to any other point in $\mathbb{R}^d$ in $n$ steps so that the intermediate points are in $X$, and the…

Combinatorics · Mathematics 2023-11-03 Endre Csóka

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Combinatorics · Mathematics 2025-06-02 Koki Furukawa

Dorais asked for the maximum guaranteed size of a dimension $d$ subposet of an $n$-element poset. A lower bound of order $\sqrt{n}$ was found by Goodwillie. We provide a sublinear upper bound for each $d$. For $d=2$, our bound is…

Combinatorics · Mathematics 2014-04-02 Benjamin Reiniger , Elyse Yeager

We describe ways to define and calculate $L_1$-norm signal subspaces which are less sensitive to outlying data than $L_2$-calculated subspaces. We start with the computation of the $L_1$ maximum-projection principal component of a data…

Data Structures and Algorithms · Computer Science 2015-06-19 Panos P. Markopoulos , George N. Karystinos , Dimitris A. Pados

Randomized dimensionality reduction has been recognized as one of the fundamental techniques in handling high-dimensional data. Starting with the celebrated Johnson-Lindenstrauss Lemma, such reductions have been studied in depth for the…

Computational Geometry · Computer Science 2019-09-10 Ioannis Z. Emiris , Vasilis Margonis , Ioannis Psarros

It is presented the simplest known disproof of the Borsuk conjecture stating that if a bounded subset of n-dimensional Euclidean space contains more than n points, then the subset can be partitioned into n+1 nonempty parts of smaller…

Combinatorics · Mathematics 2018-10-02 A. Skopenkov

We consider the random dimer model in one space dimension with Bernoulli disorder. For sufficiently small disorder, we show that the entanglement entropy exhibits at least a logarithmically enhanced area law if the Fermi energy coincides…

Mathematical Physics · Physics 2021-03-03 Peter Müller , Leonid Pastur , Ruth Schulte

We prove that in all dimensions n at least 3, for every integer N there exists a distribution of points of cardinality $ N$, for which the associated discrepancy function D_N satisfies the estimate an estimate, of sharp growth rate in N, in…

Number Theory · Mathematics 2013-06-10 Gagik Amirkhanyan , Dmitriy Bilyk , Michael T Lacey

Let $f$ be an holomorphic endomorphism of $\mathbb{C}\mathbb{P}^k$. We construct by using coding techniques a class of ergodic measures as limits of non-uniform probability measures on preimages of points. We show that they have large…

Dynamical Systems · Mathematics 2009-11-25 Christophe Dupont

We study the entanglement entropy of gapped phases of matter in three spatial dimensions. We focus in particular on size-independent contributions to the entropy across entanglement surfaces of arbitrary topologies. We show that for low…

Strongly Correlated Electrons · Physics 2018-05-11 Yunqin Zheng , Huan He , Barry Bradlyn , Jennifer Cano , Titus Neupert , B. Andrei Bernevig

A coreset of a dataset with $n$ examples and $d$ features is a weighted subset of examples that is sufficient for solving downstream data analytic tasks. Nearly optimal constructions of coresets for least squares and $\ell_p$ linear…

Data Structures and Algorithms · Computer Science 2024-06-05 David P. Woodruff , Taisuke Yasuda

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any…

Number Theory · Mathematics 2010-04-19 Mariah Hamel , Neil Lyall , Katherine Thompson , Nathan Walters

Let $\mathcal{L}$ be the closure of the set of all real numbers $\alpha$, such that there exist infinitely many integers $n$, such that $\alpha=\log\frac{d(n+1)}{d(n)}$, where $d$ is the number of divisors of $n$. We give improved lower…

Number Theory · Mathematics 2025-04-17 Jan-Christoph Schlage-Puchta

Let $n$, $q$ and $r$ be positive integers, and let $K_N^n$ be the $n$-skeleton of an $(N-1)$-simplex. We show that for $N$ sufficiently large every embedding of $K_N^n$ in $\mathbb{R}^{2n+1}$ contains a link $L_1\cup\cdots\cup L_r$…

Geometric Topology · Mathematics 2019-01-21 Christopher Tuffley

We prove the following noncommutative version of Lewis's classical result. Every n-dimensional subspace E of Lp(M) (1<p<\infty) for a von Neumann algebra M satisfies d_{cb}(E, RC^n_{p'}) \leq c_p n^{\abs{1/2-1/p}} for some constant c_p…

Functional Analysis · Mathematics 2012-08-21 Hun Hee Lee

We propose a new $(1+O(\varepsilon))$-approximation algorithm with $O(n+ 1/\varepsilon^{\frac{(d-1)}{2}})$ running time for computing the diameter of a set of $n$ points in the $d$-dimensional Euclidean space for a fixed dimension $d$,…

Computational Geometry · Computer Science 2020-11-11 Mahdi Imanparast , Seyed Naser Hashemi

It is well known that almost every dilation of a sequence of real numbers, that diverges to $\infty$, is dense modulo~1. This paper studies the exceptional set of points -- those for which the dilation is not dense. Specifically, we…

Number Theory · Mathematics 2024-09-04 Daniel Berend , Michael D. Boshernitzan , Grigori Kolesnik , Rishi Kumar

We show that the Hilbert space is coarsely embeddable into any $\ell_p$ for $1\le p<\infty$. In particular, this yields new characterizations of embeddability of separable metric spaces into the Hilbert space.

Metric Geometry · Mathematics 2011-08-09 Piotr W. Nowak

We describe dimensional entropies introduced in a previous work list some of their properties and give some new proofs. These entropies allowed the definition of entropy-expanding maps. We introduce a new notion of entropy-hyperbolicity for…

Dynamical Systems · Mathematics 2011-02-04 Jerome Buzzi

Gr\"unbaum's inequality guarantees that the centroid of a convex body has halfspace depth at least $1/e$: every halfspace containing the centroid captures at least a $1/e$ fraction of the body's volume. For mixed-integer convex sets…

Optimization and Control · Mathematics 2026-03-03 Hongyu Cheng , Amitabh Basu