Searcharxiv⌕ Search

arXiv · 2610.11449

The Erdős similarity problem for null sequences with adjacent ratios bounded below

Abstract

Let $(a_n)$ be a positive null sequence with $\liminf_{n\to\infty}a_{n+1}/a_n>0$. For every $η>0$, we construct a compact set $E\subset[0,1]$ with Lebesgue measure greater than $1-η$ containing no nontrivial affine copy of $\{a_n:n\ge1\}$. No monotonicity is assumed. The proof adapts a finite-tree construction for geometric sequences to grids chosen from a subsequence with two-sided ratio bounds. We also obtain one such set for any prescribed countable family of sequences, with infinitely many distinct points omitted from every affine copy.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Kan Jiang, Lifeng Xi. 2026-10-08. The Erdős similarity problem for null sequences with adjacent ratios bounded below. https://arxiv.org/abs/2610.11449

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Doubling, Poincaré and Gromov-Hausdorff precompactness for tamed spaces

We establish local volume doubling and a local $L^2$-Poincaré inequality for metric measure spaces tamed by a measure in the extended Kato class that satisfy the bounded interpolation property. To this end, we construct a bi-Lipschitz time change to a metric measure space satisfying a uniform lower Ricci curvature bound. As an application, we obtain pointed measured Gromov-Hausdorff precompactness for such spaces.

math.MG↗

On the Banach-Mazur Distance in Small Dimensions

We establish some results on the Banach-Mazur distance in small dimensions. Specifically, we determine the Banach-Mazur distance between the cube and its dual (the cross-polytope) in $\mathbb{R}^3$ and $\mathbb{R}^4$. In dimension three this distance is equal to $\frac{9}{5}$, and in dimension four, it is equal to 2. These findings confirm well-known conjectures, which were based on numerical data. Additionally, in dimension two, we use the asymmetry constant to provide a geometric construction of a family of convex bodies that are equidistant to all symmetric convex bodies.

math.MG↗

A combinatorial approach to nonlinear spectral gaps

A seminal open question of Pisier and Mendel--Naor asks whether every degree-regular graph which satisfies the classical discrete Poincaré inequality for scalar functions, also satisfies an analogous inequality for functions taking values in \textit{any} normed space with non-trivial cotype. Motivated by applications, it is also greatly important to quantify the dependence of the corresponding optimal Poincaré constant on the cotype $q$. Works of Odell--Schlumprecht (1994), Ozawa (2004), and Naor (2014) make substantial progress on the former question by providing a positive answer for normed spaces which also have an unconditional basis, in addition to finite cotype. However, little is known in the way of quantitative estimates: the mentioned results imply a bound on the Poincaré constant depending super-exponentially on $q$. We introduce a novel combinatorial framework for proving quantitative nonlinear spectral gap estimates. The centerpiece is a property of regular graphs that we call \emph{long range expansion}, which holds with high probability for random regular graphs. Our main result is that any regular graph with the long-range expansion property satisfies a discrete Poincaré inequality for any normed space with an unconditional basis and cotype $q$, with a Poincaré constant that depends \emph{polynomially} on $q$, which is optimal. As an application, any normed space with an unconditional basis which admits a low distortion embedding of an $n$-vertex random regular graph, must have cotype at least polylogarithmic in $n$. This extends a celebrated lower-bound of Matoušek for low distortion embeddings of random graphs into $\ell_q$ spaces.

math.MG↗