English

Reverse Littlewood--Offord problems with parity conditions

Combinatorics 2025-10-07 v1

Abstract

We consider the probability that the random signed sum ξ1v1++ξnvn\xi_1 v_1 + \dotsb + \xi_n v_n lies within a given distance rr of the origin, where v1,,vnRdv_1,\dotsc,v_n \in \mathbb{R}^d are fixed unit vectors and ξ1,,ξn\xi_1,\dotsc,\xi_n are independently and uniformly distributed on {1,+1}\{-1,+1\}. In particular, our results demonstrate that, for certain values of rr, the infimum of this probability is very sensitive to the parity of nn. We prove that, for any d3d\geq 3, there is some ε=ε(d)>0\varepsilon = \varepsilon(d) > 0 such that for any n≢dmod2n \not\equiv d \mod 2 and unit vectors v1,,vnRdv_1,\dotsc,v_n\in \mathbb{R}^d, there are signs η1,,ηn{1,+1}\eta_1,\dotsc,\eta_n \in \{-1,+1\} such that i=1nηividε\|\sum_{i=1}^n \eta_i v_i\| \leq \sqrt{d - \varepsilon}, and so P(ξ1v1++ξnvndε)>0\mathbb{P}(\| \xi_1 v_1 + \dotsb + \xi_n v_n \| \leq \sqrt{d-\varepsilon}) > 0. This is in contrast to the case of ndmod2n\equiv d \mod 2, wherein the above probability can be zero. More is known if d=2d=2 and nn is odd, and in this case we present a construction demonstrating that P(ξ1v1++ξnvn1)\mathbb{P}(\|\xi_1 v_1 + \dotsb + \xi_n v_n\| \leq 1) can decay exponentially as nn increases.

Keywords

Cite

@article{arxiv.2510.05044,
  title  = {Reverse Littlewood--Offord problems with parity conditions},
  author = {Lawrence Hollom and Gregory B. Sorkin},
  journal= {arXiv preprint arXiv:2510.05044},
  year   = {2025}
}

Comments

13 pages

R2 v1 2026-07-01T06:19:35.326Z