EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Resolution of the quadratic Littlewood–Offord problem

Matthew Kwan, Lisa Sauermann

Compositio Mathematica · 2025-12 · 161 (12) · 3089-3139

DOI: 10.1112/s0010437x25102789 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Compositio Mathematica, online erschienen am 30.03.2026. Verfasst von Matthew Kwan und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 52 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Consider a quadratic polynomial upper Q left parenthesis xi 1 comma ellipsis comma xi Subscript n Baseline right parenthesis Q ( ξ 1 , … , ξ n ) $Q(\xi_{1},\ldots,\xi_{n})$ of independent Rademacher random variables xi 1 comma ellipsis comma xi Subscript n Baseline ξ 1 , … , ξ n $\xi_{1},\ldots,\xi_{n}$ . To what extent can upper Q left parenthesis xi 1 comma ellipsis comma xi Subscript n Baseline right parenthesis Q ( ξ 1 , … , ξ n ) $Q(\xi_{1},\ldots,\xi_{n})$ concentrate on a single value? This quadratic version of the classical Littlewood–Offord problem was popularised by Costello, Tao and Vu in their study of symmetric random matrices. In this paper, we obtain an essentially optimal bound for this problem, as conjectured by Nguyen and Vu. Specifically, if upper Q left parenthesis xi 1 comma ellipsis comma xi Subscript n Baseline right parenthesis Q ( ξ 1 , … , ξ n ) $Q(\xi_{1},\ldots,\xi_{n})$ ‘robustly depends on at least m of the xi Subscript i ξ i $\xi_{i}$ ’ in the sense that there is no way to pin down the value of upper Q left parenthesis xi 1 comma ellipsis comma xi Subscript n Baseline right parenthesis Q ( ξ 1 , … , ξ n ) $Q(\xi_{1},\ldots,\xi_{n})$ by fixing values for fewer than m of the variables xi Subscript i ξ i $\xi_{i}$ , then we have normal upper P normal r left bracket upper Q left parenthesis xi 1 comma ellipsis comma xi Subscript n Baseline right parenthesis equals 0 right bracket less than or equals upper O left parenthesis 1 divided by StartRoot m EndRoot right parenthesis P r [ Q ( ξ 1 , … , ξ n ) = 0 ] ≤ O ( 1 / m ) $\mathrm{Pr}[Q(\xi_{1},\ldots,\xi_{n})=0]\le O(1/\sqrt{m})$ . This also implies a similar result in the case where xi 1 comma ellipsis comma xi Subscript n Baseline ξ 1 , … , ξ n $\xi_{1},\ldots,\xi_{n}$ have arbitrary distributions. Our proof combines a number of ideas that may be of independent interest, including an inductive decoupling scheme that reduces quadratic anticoncentration problems to high-dimensional linear anticoncentration problems. Also, one application of our main result is the resolution of a conjecture of Alon, Hefetz, Krivelevich and Tyomkyn related to graph inducibility .

Zitieren

APA

Kwan, M., & Sauermann, L. (2025). Resolution of the quadratic Littlewood–Offord problem. Compositio Mathematica, 161(12), 3089-3139. https://doi.org/10.1112/s0010437x25102789

Vancouver

Kwan M, Sauermann L. Resolution of the quadratic Littlewood–Offord problem. Compositio Mathematica. 2025;161(12):3089-3139. doi:10.1112/s0010437x25102789

BibTeX
@article{Kwan2025,
  author = {Kwan, Matthew and Sauermann, Lisa},
  title = {Resolution of the quadratic Littlewood–Offord problem},
  journal = {Compositio Mathematica},
  year = {2025},
  volume = {161},
  number = {12},
  pages = {3089--3139},
  doi = {10.1112/s0010437x25102789}
}
Kostenlos starten →