English
Related papers

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

200 papers

This paper investigates instances of Sobolev embeddings characterized by local compactness at every point within their domain, except for a single point. We obtain the sharp conditions that distinguish compactness from non-compactness and…

Functional Analysis · Mathematics 2024-09-17 Chian Yeong Chuah , Jan Lang

We consider the classic 1-center problem: Given a set $P$ of $n$ points in a metric space find the point in $P$ that minimizes the maximum distance to the other points of $P$. We study the complexity of this problem in $d$-dimensional…

Computational Complexity · Computer Science 2023-07-13 Amir Abboud , Mohammad Hossein Bateni , Vincent Cohen-Addad , Karthik C. S. , Saeed Seddighin

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Computational Geometry · Computer Science 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips

It is generally believed that in spatial dimension d > 1 the leading contribution to the entanglement entropy S = - tr rho_A log rho_A scales as the area of the boundary of subsystem A. The coefficient of this "area law" is non-universal.…

Statistical Mechanics · Physics 2009-10-24 Max A. Metlitski , Carlos A. Fuertes , Subir Sachdev

We investigate gaps of $n$-term arithmetic progressions $x, x+y, \ldots, x+(n-1)y$ inside a positive measure subset $A$ of the unit cube $[0,1]^d$. If lengths of their gaps $y$ are evaluated in the $\ell^p$-norm for any $p$ other than $1,…

Classical Analysis and ODEs · Mathematics 2022-04-27 Polona Durcik , Vjekoslav Kovač

Assuming Lang's conjectured lower bound on the heights of non-torsion points on an elliptic curve, we show that there exists an absolute constant C such that for any elliptic curve E/Q and non-torsion point P in E(Q), there is at most one…

Number Theory · Mathematics 2015-02-06 Katherine E. Stange

We introduce a 'quasi-topological` term [1] in D=1+1 dimensions and the entropy for black holes is calculated [2]. The source of entropy in this case is justified by a non-null stress-energy tensor.

High Energy Physics - Theory · Physics 2007-05-23 Carlos Pinheiro , F. C. Khanna

We prove that for every $\epsilon\in (0,1)$ there exists $C_\epsilon\in (0,\infty)$ with the following property. If $(X,d)$ is a compact metric space and $\mu$ is a Borel probability measure on $X$ then there exists a compact subset…

Metric Geometry · Mathematics 2015-06-18 Manor Mendel , Assaf Naor

We show that for any $C^1$ partially hyperbolic diffeomorphism, there is a full volume subset, such that any Cesaro limit of any point in this subset satisfies the Pesin formula for partial entropy. This result has several important…

Dynamical Systems · Mathematics 2018-12-11 Yongxia Hua , Fan Yang , Jiagang Yang

Let $(P,E)$ be a $(d+1)$-uniform geometric hypergraph, where $P$ is an $n$-point set in general position in $\mathbb{R}^d$ and $E\subseteq {P\choose d+1}$ is a collection of $\epsilon{n\choose d+1}$ $d$-dimensional simplices with vertices…

Combinatorics · Mathematics 2024-03-04 Natan Rubin

It is well known that modern deep neural networks are powerful enough to memorize datasets even when the labels have been randomized. Recently, Vershynin (2020) settled a long standing question by Baum (1988), proving that \emph{deep…

Machine Learning · Computer Science 2021-06-16 Shashank Rajput , Kartik Sreenivasan , Dimitris Papailiopoulos , Amin Karbasi

We show that if a big set of integer points in [0,N]^d, d>1, occupies few residue classes mod p for many primes p, then it must essentially lie in the solution set of some polynomial equation of low degree. This answers a question of…

Number Theory · Mathematics 2019-12-19 Miguel N. Walsh

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Combinatorics · Mathematics 2024-03-14 Dmitrii Zakharov

In 2004 the second author of the present paper proved that a point set in $[0,1]^d$ which has star-discrepancy at most $\varepsilon$ must necessarily consist of at least $c_{abs} d \varepsilon^{-1}$ points. Equivalently, every set of $n$…

Numerical Analysis · Mathematics 2017-08-02 Christoph Aistleitner , Aicke Hinrichs

Embedding-based representations in Euclidean space $\mathbb{R}^d$ are a cornerstone of modern machine learning, where a major goal is to use the \emph{smallest dimension} that faithfully captures data relations. In this work, we prove sharp…

Data Structures and Algorithms · Computer Science 2026-05-06 Dionysis Arvanitakis , Vaggos Chatziafratis , Yiyuan Luo

We prove that if $(\mathcal{M},d)$ is an $n$-point metric space that embeds quasisymmetrically into a Hilbert space, then for every $\tau>0$ there is a random subset $\mathcal{Z}$ of $\mathcal{M}$ such that for any pair of points $x,y\in…

Metric Geometry · Mathematics 2025-03-13 Alan Chang , Assaf Naor , Kevin Ren

The dimension of a graph $G$ is the smallest $d$ for which its vertices can be embedded in $d$-dimensional Euclidean space in the sense that the distances between endpoints of edges equal $1$ (but there may be other unit distances).…

Combinatorics · Mathematics 2020-02-25 Nóra Frankl , Andrey Kupavskii , Konrad J. Swanepoel

We prove that for $1\le k<d$, if $E$ is a Borel subset of $\mathbb{R}^d$ of Hausdorff dimension strictly larger than $k$, the set of $(k+1)$-volumes determined by $k+2$ points in $E$ has positive one-dimensional Lebesgue measure. In the…

Classical Analysis and ODEs · Mathematics 2025-03-31 Pablo Shmerkin , Alexia Yavicoli

Consider a dataset of n(d) points generated independently from R^d according to a common p.d.f. f_d with support(f_d) = [0,1]^d and sup{f_d([0,1]^d)} growing sub-exponentially in d. We prove that: (i) if n(d) grows sub-exponentially in d,…

Databases · Computer Science 2009-09-01 Chris Giannella

It is shown in this note that one can decide whether an $n$-dimensional subspace of $\ell_\infty^N$ is isometrically isomorphic to $\ell_\infty^n$ by testing a finite number of determinental inequalities. As a byproduct, an elementary proof…

Functional Analysis · Mathematics 2025-09-23 Beata Deregowska , Simon Foucart , Barbara Lewandowska