An algebraic inverse theorem for the quadratic Littlewood-Offord problem, and an application to Ramsey graphs

preprint2020arXivOpen access

Abstract

Consider a quadratic polynomial f(ξ1,…,ξn)f\left(ξ_{1},\dots,ξ_{n}\right) of independent Bernoulli random variables. What can be said about the concentration of ff on any single value? This generalises the classical Littlewood--Offord problem, which asks the same question for linear polynomials. As in the linear case, it is known that the point probabilities of ff can be as large as about 1/n1/\sqrt{n}, but still poorly understood is the "inverse" question of characterising the algebraic and arithmetic features ff must have if it has point probabilities comparable to this bound. In this paper we prove some results of an algebraic flavour, showing that if ff has point probabilities much larger than 1/n1/n then it must be close to a quadratic form with low rank. We also give an application to Ramsey graphs, asymptotically answering a question of Kwan, Sudakov and Tran.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.