Related papers: An improved constant in Banaszczyk's transference …

Let $\gamma_n$ be the standard Gaussian measure on $\mathbb{R}^n$. We prove that for every symmetric convex sets $K,L$ in $\mathbb{R}^n$ and every $\lambda\in(0,1)$, $$\gamma_n(\lambda K+(1-\lambda)L)^{\frac{1}{n}} \geq \lambda…

Consider the integer best approximations of a linear form in $n\ge 2$ real variables. While it is well-known that any tail of this sequence always spans a lattice is sharp for any $n\ge 2$. In this paper, we determine the exact Hausdorff…

For $(\lambda_{1},...,\lambda_{d})=\lambda\in(0,1)^{d}$ with $\lambda_{1}>...>\lambda_{d}$, denote by $\mu_{\lambda}$ the Bernoulli convolution associated to $\lambda$. That is, $\mu_{\lambda}$ is the distribution of the random vector…

In this article we discuss the Mass Transference Principle due to Beresnevich and Velani and survey several generalisations and variants, both deterministic and random. Using a Hausdorff measure analogue of the inhomogeneous…

We prove a transfer theorem which, when combined with the Jaffard-Kaplansky-Ohm Theorem, allows results in model theory of modules over B\'ezout domains to be translated into results over Pr\"ufer domains via their value groups. Extending…

For a complete graph of size $n$, assign each edge an i.i.d. exponential variable with mean $n$. For $\lambda>0$, consider the length of the longest path whose average weight is at most $\lambda$. It was shown by Aldous (1998) that the…

For any integers $d, n \geq 2$ and $1/({\min\{n,d\}})^{0.4999} < \varepsilon<1$, we show the existence of a set of $n$ vectors $X\subset \mathbb{R}^d$ such that any embedding $f:X\rightarrow \mathbb{R}^m$ satisfying $$ \forall x,y\in X,\…

Given a set $A=\{a_1,\ldots,a_n\}$ of real numbers and real coefficients $b_1,\ldots,b_n$, consider the distribution of the sum obtained by pairing the $a_i$'s with the $b_i$'s according to a uniformly random permutation. A recent theorem…

We prove a local limit theorem for Lipschitz continuous observables on a weakly coupled lattice of piecewise expanding interval maps. The core of the paper is a proof that the spectral radii of the Fourier-transfer operators for such a…

A sharp version of the Balian-Low theorem is proven for the generators of finitely generated shift-invariant spaces. If generators $\{f_k\}_{k=1}^K \subset L^2(\mathbb{R}^d)$ are translated along a lattice to form a frame or Riesz basis for…

In this paper we prove an asymptotic lower bound for the sphere packing density in dimensions divisible by four. This asymptotic lower bound improves on previous asymptotic bounds by a constant factor and improves not just lower bounds for…

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…

Let $M^n$ be a closed Riemannian manifold. Larry Guth proved that there exists $c(n)$ with the following property: if for some $r>0$ the volume of each metric ball of radius $r$ is less than $({r\over c(n)})^n$, then there exists a…

We use a characterization of Minkowski measurability to study the asymptotics of best packing on cut-out subsets of the real line with Minkowski dimension $d\in(0,1)$. Our main result is a proof that Minkowski measurability is a sufficient…

Let $A$ be an $n\times n$ random matrix with independent rows $R_1(A),\dots,R_n(A)$, and assume that for any $i\leq n$ and any three-dimensional linear subspace $F\subset {\mathbb R}^n$ the orthogonal projection of $R_i(A)$ onto $F$ has…

In the study of Euclidean lattices, the product of the successive minima is bounded from above and below by explicit quantities. This result is known as Minkowski's second theorem, and can be refined to include Hermite's constant in the…

We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…

While empirical scaling laws for LLM reasoning are well-documented, the theoretical mechanisms governing out-of-distribution (OOD) generalization remain elusive. We formalize reasoning via optimal transport, projecting discrete trajectories…