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

Abstract

Erdos conjectured in 1945 that for any unit vectors v1, …c, vn in R2 and signs 1, …c, n taken independently and uniformly in \-1,1\, the random Rademacher sum σ = 1 v1 + …b + n vn satisfies \|σ\|2 ≤ 1 with probability (1/n). While this conjecture is false for even n, Beck has proved that \|σ\|2 ≤ 2 always holds with probability (1/n). Recently, He, Juskevicius, Narayanan, and Spiro conjectured that the Erdos' conjecture holds when n is odd. We disprove this conjecture by exhibiting vectors v1, …c, vn for which \|σ\|2 ≤ 1 occurs with probability O(1/n3/2). On the other hand, an approximated version of their conjecture holds: we show that we always have \|σ\|2 ≤ 1 + δ with probability δ(1/n), for all δ > 0. This shows that when n is odd, the minimum probability that \|σ\|2 ≤ r exhibits a double-jump phase transition at r = 1, as we can also show that \|σ\|2 ≤ 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, Juskevicius, Narayanan, and Spiro, concerning the optimal constructions minimising the probability that \|σ\|2 ≤ 2. We also make some progress on the higher dimensional versions of these questions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…