English
Related papers

Related papers: A spectral gap precludes low-dimensional embedding…

200 papers

Recent methods developed by Tao \cite{tao}, Kolountzakis and Matolcsi \cite{nspec} have led to counterexamples to Fugelde's Spectral Set Conjecture in both directions. Namely, in $\RR^5$ Tao produced a spectral set which is not a tile,…

Classical Analysis and ODEs · Mathematics 2007-05-23 Bálint Farkas , Máté Matolcsi , Péter Móra

We prove a generalized version of Schmidt's subspace theorem for closed subschemes in general position in terms of suitably defined Seshadri constants with respect to a fixed ample divisor. Our proof builds on previous work by Evertse and…

Number Theory · Mathematics 2019-07-02 Gordon Heier , Aaron Levin

We show that if $(X,T)$ is an extension of an aperiodic subshift (a subsystem of $({1,2,...,l}^{\mathbb{Z}},\mathrm{shift})$ for some $l\in\mathbb{N}$) and has mean dimension $mdim(X,T)<\frac{D}{2}$ $(D\in \mathbb{N}$), then it embeds…

Dynamical Systems · Mathematics 2019-02-20 Yonatan Gutman , Masaki Tsukamoto

Let $(X, \Gamma)$ be a free and minimal topological dynamical system, where $X$ is a separable compact Hausdorff space and $\Gamma$ is a countable infinite discrete amenable group. It is shown that if $(X, \Gamma)$ has the Uniform Rokhlin…

Operator Algebras · Mathematics 2020-08-11 Zhuang Niu

For every positive integer $d$, we show that there must exist an absolute constant $c > 0$ such that the following holds: for any integer $n \geq cd^{7}$ and any red-blue coloring of the one-dimensional subspaces of $\mathbb{F}_{2}^{n}$,…

Combinatorics · Mathematics 2024-12-24 Zach Hunter , Cosmin Pohoata

Let $X_{m} = G_{1}\ldots G_{m}$ denote the product of $m$ independent random matrices of size $N \times N$, with each matrix in the product consisting of independent standard Gaussian variables. Denoting by $N_{\mathbb{R}}(m)$ the total…

Probability · Mathematics 2017-02-01 Nick Simm

We prove, using the subspace embedding guarantee in a black box way, that one can achieve the spectral norm guarantee for approximate matrix multiplication with a dimensionality-reducing map having $m = O(\tilde{r}/\varepsilon^2)$ rows.…

Data Structures and Algorithms · Computer Science 2016-03-03 Michael B. Cohen , Jelani Nelson , David P. Woodruff

We prove the sharp embedding between the spectral Barron space and the Besov space with embedding constants independent of the input dimension. Given the spectral Barron space as the target function space, we prove a dimension-free…

Numerical Analysis · Mathematics 2025-07-16 Yulei Liao , Pingbing Ming

Let $A\in\mathbb{R}^{n\times n}$ be a random matrix with independent entries, and suppose that the entries are "uniformly anticoncentrated" in the sense that there is a constant $\varepsilon>0$ such that each entry $a_{ij}$ satisfies…

Probability · Mathematics 2025-09-29 Zach Hunter , Matthew Kwan , Lisa Sauermann

We establish a free analogue of Obata's rigidity theorem. More precisely, Cheng and Zhou (2017) proved that on a weighted Riemannian manifold, the sharp spectral gap (Poincar\'e constant) is achieved only when the space splits isometrically…

Operator Algebras · Mathematics 2026-03-06 Charles-Philippe Diez

A Riemannian n-manifold M has k-dimensional Uryson width bounded by a constant c >0 if there exists a continuous map f from M to an k-dimensional polyhedral space P, such that the pullbacks f^{-1}(p) of all points p in P have diameters…

Differential Geometry · Mathematics 2020-05-05 Jon Wolfson

In this note, we prove that there exists a universal constant $c=\frac{43}{50}$ such that for every $k\in \mathbb{N}$ and every $d<k/2$, every $k$-uniform hypergraph on $n$ vertices and with minimum $d$-degree at least…

Combinatorics · Mathematics 2019-04-09 Asaf Ferber , Vishesh Jain

We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability measure. This provides a refined and unified framework for the…

Data Structures and Algorithms · Computer Science 2007-05-23 Robert Krauthgamer , James R. Lee , Manor Mendel , Assaf Naor

We prove a weak version of the Perdomo Conjecture, namely, there is a positive constant $\delta(n)>0$ depending only on $n$ such that on any closed embedded, non-totally geodesic, minimal hypersurface $M^n$ in $\mathbb{S}^{n+1}$,…

Differential Geometry · Mathematics 2021-09-10 Jianquan Ge , Fagui Li

For any $\alpha\in (0,1)$ and any $n^{\alpha}\leq d\leq n/2$, we show that $\lambda(G)\leq C_\alpha \sqrt{d}$ with probability at least $1-\frac{1}{n}$, where $G$ is the uniform random $d$-regular graph on $n$ vertices, $\lambda(G)$ denotes…

Probability · Mathematics 2019-01-07 Konstantin Tikhomirov , Pierre Youssef

We study the property of spectral-tightness of Riemannian manifolds, which means that the bottom of the spectrum of the Laplacian separates the universal covering space from any other normal covering space of a Riemannian manifold. We prove…

Differential Geometry · Mathematics 2021-10-13 Panagiotis Polymerakis

A {\em universal 1-bit compressive sensing (CS)} scheme consists of a measurement matrix $A$ such that all signals $x$ belonging to a particular class can be approximately recovered from $\textrm{sign}(Ax)$. 1-bit CS models extreme…

Information Theory · Computer Science 2022-05-19 Sidhant Bansal , Arnab Bhattacharyya , Anamay Chaturvedi , Jonathan Scarlett

We consider uniformly (DC) or periodically (AC) driven generalized infinite elastic chains (a generalized Frenkel-Kontorova model) with gradient dynamics. We first show that the union of supports of all the invariant measures, denoted by A,…

Dynamical Systems · Mathematics 2013-05-07 Siniša Slijepčević

We show that an n-dimensional compactum X embeds in R^m, where m>3(n+1)/2, if and only if X x X - \Delta admits an equivariant map to S^{m-1}. In particular, X embeds in R^{2n}, n>3, iff the top power of the (twisted) Euler class of the…

Geometric Topology · Mathematics 2007-05-23 Sergey A. Melikhov , Evgenij V. Shchepin

We prove that there is a universal constant $C>0$ so that for every $d \in \mathbb N$, every centered subgaussian distribution $\mathcal D$ on $\mathbb R^d$, and every even $p \in \mathbb N$, the $d$-variate polynomial $(Cp)^{p/2} \cdot…

Data Structures and Algorithms · Computer Science 2024-10-29 Ilias Diakonikolas , Samuel B. Hopkins , Ankit Pensia , Stefan Tiegel