- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- An algebraic inverse theorem for the quadratic Littlewoodâ...
Open Collections
BIRS Workshop Lecture Videos
BIRS Workshop Lecture Videos
An algebraic inverse theorem for the quadratic Littlewoodâ Offord problem Kwan, Matthew
Description
Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ 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 $f$ can be as large as about $1/\sqrt{n}$, but still poorly understood is the ``inverse'' question of characterising the algebraic and arithmetic features $f$ must have if it has point probabilities comparable to this bound. In this talk we present some results of an algebraic flavour, showing that if $f$ has point probabilities much larger than $1/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. Joint work with Lisa Sauermann.
Item Metadata
Title |
An algebraic inverse theorem for the quadratic Littlewoodâ Offord problem
|
Creator | |
Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
Date Issued |
2019-09-03T11:20
|
Description |
Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ 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 $f$ can be as large as about $1/\sqrt{n}$, but still poorly understood is the ``inverse'' question of characterising the algebraic and arithmetic features $f$ must have if it has point probabilities comparable to this bound. In this talk we present some results of an algebraic flavour, showing that if $f$ has point probabilities much larger than $1/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.
Joint work with Lisa Sauermann.
|
Extent |
36.0 minutes
|
Subject | |
Type | |
File Format |
video/mp4
|
Language |
eng
|
Notes |
Author affiliation: Stanford University
|
Series | |
Date Available |
2020-09-05
|
Provider |
Vancouver : University of British Columbia Library
|
Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
DOI |
10.14288/1.0394206
|
URI | |
Affiliation | |
Peer Review Status |
Unreviewed
|
Scholarly Level |
Postdoctoral
|
Rights URI | |
Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International