Research Paper#Anti-concentration, Permutations, Symmetric Group, Probability🔬 ResearchAnalyzed: Jan 4, 2026 00:06
Littlewood-Offord Bounds on Permutations
Published:Dec 25, 2025 20:32
•1 min read
•ArXiv
Analysis
This paper investigates anti-concentration phenomena in the context of the symmetric group, a departure from the typical product space setting. It focuses on the random sum of weighted vectors permuted by a random permutation. The paper's significance lies in its novel approach to anti-concentration, providing new bounds and structural characterizations, and answering an open question. The applications to permutation polynomials and other results strengthen existing knowledge in the field.
Key Takeaways
Reference
“The paper establishes a near-optimal structural characterization of the vectors w and v under the assumption that the concentration probability is polynomially large. It also shows that if both w and v have distinct entries, then sup_x P(S_π=x) ≤ n^{-5/2+o(1)}.”