<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>Resolution of the quadratic Littlewood–Offord problem</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Matthew Alan</namePart>
  <namePart type="family">Kwan</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">5fca0887-a1db-11eb-95d1-ca9d5e0453b3</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-4003-7567</description></name>
<name type="personal">
  <namePart type="given">Lisa</namePart>
  <namePart type="family">Sauermann</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">MaKw</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>





<name type="corporate">
  <namePart>Randomness and structure in combinatorics</namePart>
  <role><roleTerm type="text">project</roleTerm></role>
</name>



<abstract lang="eng">Consider a quadratic polynomial Q(ξ1, . . . , ξn) of independent Rademacher random variables ξ1, . . . , ξn. To what extent can Q(ξ1, . . . , ξ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 Q(ξ1, . . . , ξn) ‘robustly depends on at least m of the ξi’ in the sense that there is no way to pin down the value of Q(ξ1, . . . , ξn) by fixing values for fewer than m of the variables ξi, then we have Pr[Q(ξ1, . . . , ξn) = 0] ≤ O(1/√m). This also implies a similar result in the case where ξ1, . . . , ξ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. </abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2025_CompositioMath_Kwan.pdf">https://research-explorer.ista.ac.at/download/21706/21787/2025_CompositioMath_Kwan.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem><accessCondition type="use and reproduction">https://creativecommons.org/licenses/by/4.0/</accessCondition>
<originInfo><publisher>Cambridge University Press</publisher><dateIssued encoding="w3cdtf">2025</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Compositio Mathematica</title></titleInfo>
  <identifier type="issn">0010-437X</identifier>
  <identifier type="eIssn">1570-5846</identifier>
  <identifier type="arXiv">2312.13826</identifier><identifier type="doi">10.1112/S0010437X25102789</identifier>
<part><detail type="volume"><number>161</number></detail><detail type="issue"><number>12</number></detail><extent unit="pages">3089-3139</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ieee>M. A. Kwan and L. Sauermann, “Resolution of the quadratic Littlewood–Offord problem,” &lt;i&gt;Compositio Mathematica&lt;/i&gt;, vol. 161, no. 12. Cambridge University Press, pp. 3089–3139, 2025.</ieee>
<short>M.A. Kwan, L. Sauermann, Compositio Mathematica 161 (2025) 3089–3139.</short>
<mla>Kwan, Matthew Alan, and Lisa Sauermann. “Resolution of the Quadratic Littlewood–Offord Problem.” &lt;i&gt;Compositio Mathematica&lt;/i&gt;, vol. 161, no. 12, Cambridge University Press, 2025, pp. 3089–139, doi:&lt;a href=&quot;https://doi.org/10.1112/S0010437X25102789&quot;&gt;10.1112/S0010437X25102789&lt;/a&gt;.</mla>
<ama>Kwan MA, Sauermann L. Resolution of the quadratic Littlewood–Offord problem. &lt;i&gt;Compositio Mathematica&lt;/i&gt;. 2025;161(12):3089-3139. doi:&lt;a href=&quot;https://doi.org/10.1112/S0010437X25102789&quot;&gt;10.1112/S0010437X25102789&lt;/a&gt;</ama>
<apa>Kwan, M. A., &amp;#38; Sauermann, L. (2025). Resolution of the quadratic Littlewood–Offord problem. &lt;i&gt;Compositio Mathematica&lt;/i&gt;. Cambridge University Press. &lt;a href=&quot;https://doi.org/10.1112/S0010437X25102789&quot;&gt;https://doi.org/10.1112/S0010437X25102789&lt;/a&gt;</apa>
<ista>Kwan MA, Sauermann L. 2025. Resolution of the quadratic Littlewood–Offord problem. Compositio Mathematica. 161(12), 3089–3139.</ista>
<chicago>Kwan, Matthew Alan, and Lisa Sauermann. “Resolution of the Quadratic Littlewood–Offord Problem.” &lt;i&gt;Compositio Mathematica&lt;/i&gt;. Cambridge University Press, 2025. &lt;a href=&quot;https://doi.org/10.1112/S0010437X25102789&quot;&gt;https://doi.org/10.1112/S0010437X25102789&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>21706</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-04-12T22:01:48Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-05-04T09:42:57Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
