3 citations · 5 across the 9 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Optimal bound for the polynomial Littlewood-Offord problem
Alexandr Grebennikov
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 be a degree- multilin…
math.CO2026
No--in-line problem for
Anubhab Ghosal, Ritesh Goenka, Alexandr Grebennikov +3
What is the maximum number of points one can place in an grid such that every Euclidean line contains at most points? For , this is the notorious no-three-i…