A new bound in the Littlewood--Offord problem
Friedrich G\"otze, Andrei Yu. Zaitsev

TL;DR
This paper explores a novel bound related to the Littlewood--Offord problem, connecting it with the concentration functions of symmetric infinitely divisible distributions, advancing understanding in probabilistic combinatorics.
Contribution
It introduces a new bound in the Littlewood--Offord problem and links it to concentration functions of symmetric infinitely divisible distributions.
Findings
Established a new bound in the Littlewood--Offord problem.
Connected the problem with concentration functions of symmetric infinitely divisible distributions.
Provided insights into probabilistic combinatorics and distribution concentration.
Abstract
The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
