~/talk

Quantitative Aspects of the Idempotent Theorem

links:none on file
slides:none on file

Proves a quantitative idempotent theorem: an integer‑valued (or ±1) function with small Fourier algebra norm m decomposes as a signed sum of few subgroup coset indicators — previous doubly‑exponential bounds drop to about exp(O(m^4)) many cosets. Key tools are additive‑energy arguments + Balog–Szemerédi–Gowers/Freiman input, a Chang/Rudin type structural lemma to find a subgroup of codimension O(m), and an L^p bootstrapping that forces ε to be exponentially small; the construction is effective and yields the stated bound.

AI-written summary · about

  1. 0:00Introduction
  2. 3:15Group projections and decompositions
  3. 10:02Projection norms and quality
  4. 12:31Representations and decompositions
  5. 23:49Idempotent Theorems
  6. 34:17Decomposing functions with subgroups
  7. 41:14Decomposition challenges
  8. 45:34Quantitative continuity and subgroups
  9. 52:12Improving bounds and results
  10. 57:23Summary
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.