English
Related papers

Related papers: Dimension bound for badly approximable grids

200 papers

We show that an $n$-dimensional surface whose entropy is close to that of an $n$-dimensional plane is close in Hausdorff distance to some $n$-dimensional plane at every scale. Moreover we show that self-expanders of low entropy converge in…

Differential Geometry · Mathematics 2020-03-18 Letian Chen

For an ordered set $W=\{w_1,w_2,...,w_k\}$ of vertices and a vertex $v$ in a connected graph $G$, the ordered $k$-vector $r(v|W):=(d(v,w_1),d(v,w_2),...,d(v,w_k))$ is called the (metric) representation of $v$ with respect to $W$, where…

Combinatorics · Mathematics 2011-03-18 Mohsen Jannesari , Behnaz Omoomi

We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…

Metric Geometry · Mathematics 2018-03-22 Antoine Deza , Lionel Pournin

The notion of metric entropy dimension is introduced to measure the complexity of entropy zero dynamical systems. For measure preserving systems, we define entropy dimension via the dimension of entropy generating sequences. This…

Dynamical Systems · Mathematics 2018-02-27 Dou Dou , Wen Huang , Kyewon Koh Park

A pair $(A,\mathbf{b})$ of a real $m\times n$ matrix $A$ and $\mathbf{b}\in\mathbb{R}^m$ is said to be $\textit{infinitely badly approximable}$ if \[ \liminf_{\mathbf{q}\in\mathbb{Z}^n, \|\mathbf{q}\|\to\infty}…

Number Theory · Mathematics 2025-09-23 Taehyeong Kim

We prove that for every $\epsilon>0$ there exists $\delta>0$ such that the following holds. Let $\mathcal{C}$ be a collection of $n$ curves in the plane such that there are at most $(\frac{1}{4}-\epsilon)\frac{n^{2}}{2}$ pairs of curves…

Combinatorics · Mathematics 2019-08-16 Istvan Tomon

In this paper we deal with a best approximation of a vector with respect to a closed semi-algebraic set $C$ in the space $\mathbb{R}^n$ endowed with a semi-algebraic norm $\nu$. Under additional assumptions on $\nu$ we prove…

Algebraic Geometry · Mathematics 2018-09-07 Shmuel Friedland , Malgorzata Stawiska

Consider a linear program of the form $\max\;c^{\top}x:Ax\leq b$, where $A$ is an $m\times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an optimal solution $x^{*}$, if an optimal integral solution…

Optimization and Control · Mathematics 2021-11-03 Marcel Celaya , Stefan Kuhlmann , Joseph Paat , Robert Weismantel

We show that there exists $k \in \bbn$ and $0 < \e \in\bbr$ such that for every field $F$ of characteristic zero and for every $n \in \bbn$, there exists explicitly given linear transformations $T_1,..., T_k: F^n \to F^n$ satisfying the…

Group Theory · Mathematics 2008-04-15 A. Lubotzky , E. Zelmanov

The spectral principle of Connes and Chamseddine is used as a starting point to define a discrete model for Euclidean quantum gravity. Instead of summing over ordinary geometries, we consider the sum over generalized geometries where…

High Energy Physics - Theory · Physics 2009-11-10 Luiz C. de Albuquerque , Jorge L. deLyra , Paulo Teotonio-Sobrinho

We study sets of local dimensions for self-similar measures in $\mathbb{R}$ satisfying the finite neighbour condition, which is formally stronger than the weak separation condition but satisfied in all known examples. Under a mild technical…

Dynamical Systems · Mathematics 2022-09-07 Kathryn E. Hare , Alex Rutar

We study distributionally robust optimization (DRO) problems with uncertainty sets consisting of high-dimensional random vectors that are close in the multivariate Wasserstein distance to a reference random vector. We give conditions when…

Optimization and Control · Mathematics 2026-01-30 Brandon Tam , Silvana M. Pesenti

In this paper, we use algorithmic tools, effective dimension and Kolmogorov complexity, to study the fractal dimension of distance sets. We show that, for any analytic set $E\subseteq\R^2$ of Hausdorff dimension strictly greater than one,…

Computational Complexity · Computer Science 2022-08-16 D. M. Stull

The $2$-Wasserstein distance is sensitive to minor geometric differences between distributions, making it a very powerful dissimilarity metric. However, due to this sensitivity, a small outlier mass can also cause a significant increase in…

Machine Learning · Computer Science 2024-06-04 Sharath Raghvendra , Pouyan Shirzadian , Kaiyi Zhang

According to a well known theorem of Haussler and Welzl (1987), any range space of bounded VC-dimension admits an $\eps$-net of size $O\left(\frac{1}{\eps}\log\frac1{\eps}\right)$. Using probabilistic techniques, Pach and Woeginger (1990)…

Discrete Mathematics · Computer Science 2010-12-07 János Pach , Gábor Tardos

Let $\mathbf{X} = (X_i)_{1\leq i \leq n}$ be an i.i.d. sample of square-integrable variables in $\mathbb{R}^d$, \GB{with common expectation $\mu$ and covariance matrix $\Sigma$, both unknown.} We consider the problem of testing if $\mu$ is…

Machine Learning · Computer Science 2021-10-11 Gilles Blanchard , Jean-Baptiste Fermanian

Given a subset K of the unit Euclidean sphere, we estimate the minimal number m = m(K) of hyperplanes that generate a uniform tessellation of K, in the sense that the fraction of the hyperplanes separating any pair x, y in K is nearly…

Probability · Mathematics 2013-09-27 Yaniv Plan , Roman Vershynin

Let $G$ be a graph attaining the maximum spectral radius among all connected nonregular graphs of order $n$ with maximum degree $\Delta$. Let $\lambda_1(G)$ be the spectral radius of $G$. A nice conjecture due to Liu, Shen and Wang [On the…

Combinatorics · Mathematics 2022-03-25 Lele Liu

We solve Talagrand's entropy problem: the L_2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley's theorem on classes of {0,1}-valued functions, for which the…

Functional Analysis · Mathematics 2016-12-23 S. Mendelson , R. Vershynin

We show that, for any $0<\gamma<1/2$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set with Hausdorff dimension about $\sqrt{\gamma}$, any small $0<\varepsilon<1$ and any large $N\in\mathbb{N}$, the number of integers $n\in[1,N]$ such…

Number Theory · Mathematics 2022-12-01 Shunsuke Usuki