Search arXivSearch

arXiv · 2503.24202

Double-jump phase transition for the reverse Littlewood--Offord problem

Abstract

Erdős conjectured in 1945 that for any unit vectors $v_1, \dotsc, v_n$ in $\mathbb{R}^2$ and signs $\varepsilon_1, \dotsc, \varepsilon_n$ taken independently and uniformly in $\{-1,1\}$, the random Rademacher sum $σ= \varepsilon_1 v_1 + \dotsb + \varepsilon_n v_n$ satisfies $\|σ\|_2 \leq 1$ with probability $Ω(1/n)$. While this conjecture is false for even $n$, Beck has proved that $\|σ\|_2 \leq \sqrt{2}$ always holds with probability $Ω(1/n)$. Recently, He, Juškevičius, Narayanan, and Spiro conjectured that the Erdős' conjecture holds when $n$ is odd. We disprove this conjecture by exhibiting vectors $v_1, \dotsc, v_n$ for which $\|σ\|_2 \leq 1$ occurs with probability $O(1/n^{3/2})$. On the other hand, an approximated version of their conjecture holds: we show that we always have $\|σ\|_2 \leq 1 + δ$ with probability $Ω_δ(1/n)$, for all $δ> 0$. This shows that when $n$ is odd, the minimum probability that $\|σ\|_2 \leq r$ exhibits a double-jump phase transition at $r = 1$, as we can also show that $\|σ\|_2 \leq 1$ occurs with probability at least $Ω((1/2+μ)^n)$ for some $μ> 0$. Additionally, and using a different construction, we give a negative answer to a question of Beck and two other questions of He, Juškevičius, Narayanan, and Spiro, concerning the optimal constructions minimising the probability that $\|σ\|_2 \leq \sqrt{2}$. We also make some progress on the higher dimensional versions of these questions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lawrence Hollom, Julien Portier, Victor Souza. 2025-03-31. Double-jump phase transition for the reverse Littlewood--Offord problem. https://arxiv.org/abs/2503.24202

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO