Reverse Littlewood--Offord problems with parity conditions
Abstract
We consider the probability that the random signed sum 1 v1 + …b + n vn lies within a given distance r of the origin, where v1,…c,vn ∈ Rd are fixed unit vectors and 1,…c,n are independently and uniformly distributed on \-1,+1\. In particular, our results demonstrate that, for certain values of r, the infimum of this probability is very sensitive to the parity of n. We prove that, for any d≥ 3, there is some = (d) > 0 such that for any n d 2 and unit vectors v1,…c,vn∈ Rd, there are signs η1,…c,ηn ∈ \-1,+1\ such that \|Σi=1n ηi vi\| ≤ d - , and so P(\| 1 v1 + …b + n vn \| ≤ d-) > 0. This is in contrast to the case of n d 2, wherein the above probability can be zero. More is known if d=2 and n is odd, and in this case we present a construction demonstrating that P(\|1 v1 + …b + n vn\| ≤ 1) can decay exponentially as n increases.
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.