Skip to content

Author

Alexandr Grebennikov

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Oct 2026

Optimal bound for the polynomial Littlewood-Offord problem

We present an exposition of an argument, discovered by GPT-6 Pro, that gives an optimal bound for the polynomial Littlewood-Offord problem. Namely, let $F$ be a degree-$d$ multilinear polynomial that contains $r$ degree-$d$ monomials involving disjoint sets of variables. Then, for i.i.d. Rademacher random variables $\x...

Alexandr Grebennikov · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.