Related papers: Dimension bound for badly approximable grids

There is a constant c > 0 such that for every $\epsilon \in (0,1)$ and $n \geq 1/\epsilon^2$, the following holds. Any mapping from the $n$-point star metric into $\ell_1^d$ with bi-Lipschitz distortion $1+\epsilon$ requires dimension $$d…

We introduce the concept of boundariness capturing the most efficient way of expressing a given element of a convex set as a probability mixture of its boundary elements. In other words, this number measures (without the need of any…

Let $K\subset\mathbb R^d$ be a compact subset equipped with a $\delta$-Ahlfors regular measure $\mu$. For any $\tau>1/d$ and any ``inhomogeneous'' vector $\boldsymbol{\theta}\in\mathbb R^d$, let $W_d(\psi_\tau,\boldsymbol{\theta})$ denote…

We obtain an essential spectral gap for a convex co-compact hyperbolic surface $M=\Gamma\backslash\mathbb H^2$ which depends only on the dimension $\delta$ of the limit set. More precisely, we show that when $\delta>0$ there exists…

Let $G$ be a connected graph of order $n$.The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. In this paper we show that the well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n…

We establish a regularity result for the metric on any 4-dimensional extremal K\"ahler manifold, and a weak compactness theorem on the space of such metrics. Specifically, the sectional curvature at a point is bounded when the quantity…

We give the first nonconstant lower bounds for the approximability of the Independent Set Problem on the Power Law Graphs. These bounds are of the form $n^{\epsilon}$ in the case when the power law exponent satisfies $\beta <1$. In the case…

Given a set of $n$ points in $R^2$, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least $k > 1$ of these points is $O(n^2/k^3 + n/k)$. J.\ Solymosi conjectured that if one requires the…

By Brook's Theorem, every n-vertex graph of maximum degree at most Delta >= 3 and clique number at most Delta is Delta-colorable, and thus it has an independent set of size at least n/Delta. We give an approximate characterization of graphs…

We show that if $(X, \mu, T)$ is a probability measure-preserving dynamical system, and $\mathscr{P}$ is a countable partition of $(X, \mu)$, then the limit $$ \lim_{n, k \to \infty} \mathbb{E} \left[ \frac{1}{k} \sum_{j = 0}^{k - 1} f…

In this paper, we adopt the eigenvector empirical spectral distribution (VESD) to investigate the limiting behavior of eigenvectors of a large dimensional Wigner matrix W_n. In particular, we derive the optimal bound for the rate of…

We give a new proof of the Gromov theorem: For any $C>0$ and integer $n>1$ there exists a function $\Delta_{C,n}$ such that if the Gromov--Hausdorff distance between complete Riemannian $n$-manifolds $V$ and $W$ is not greater than…

Let $\Gamma_{w}$ be a non-cofinite Hecke triangle group with cusp width $w>2$ and let $\varrho\colon\Gamma_w\to U(V)$ be a finite-dimensional unitary representation of $\Gamma_w$. In this note we announce a new fractal upper bound for the…

For a finite dimensional representation $V$ of a group $G$ over a field $F$, the degree of reductivity $\delta(G,V)$ is the smallest degree $d$ such that every nonzero fixed point $v\in V^{G}\setminus\{0\}$ can be separated from zero by a…

Let $M^n$ be a complete, open Riemannian manifold with $\Ric \geq 0$. In 1994, Grigori Perelman showed that there exists a constant $\delta_{n}>0$, depending only on the dimension of the manifold, such that if the volume growth satisfies…

We derive a scale-free bound on the density of the maximum of a centered Gaussian vector. The basic bound is non-uniform, depends logarithmically on the dimension, and allows any covariance matrix. When the largest marginal variance is…

We give a complete proof that in any finite-dimensional normed linear space a finite set of points has a minimal spanning tree in which the maximum degree is bounded above by the strict Hadwiger number of the unit ball, i.e., the largest…

The problem of finding the largest connected subgraph of a given undirected host graph, subject to constraints on the maximum degree $\Delta$ and the diameter $D$, was introduced in \cite{maxddbs}, as a generalization of the Degree-Diameter…

Let $\mathcal{H}$ be an $r$-uniform hypergraph. The \emph{minimum positive co-degree} of $\mathcal{H}$, denoted by $\delta_{r-1}^+(\mathcal{H})$, is the minimum $k$ such that if $S$ is an $(r-1)$-set contained in a hyperedge of…

It is shown that the volume entropy of a Hilbert geometry associated to an $n$-dimensional convex body of class $C^{1,1}$ equals $n-1$. To achieve this result, a new projective invariant of convex bodies, similar to the centro-affine area,…