Equivalence of polynomial conjectures in additive combinatorics

DOI10.1007/s00493-012-2714-zzbMath1274.11158arXiv1001.3356OpenAlexW114376811WikidataQ122932193 ScholiaQ122932193MaRDI QIDQ377805

Shachar Lovett

Publication date: 7 November 2013

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.3356

zbMATH Keywords

polynomial Freiman-Ruzsa conjecturepolynomial inverse Gowers conjecture for \(U^3\)

Mathematics Subject Classification ID

Inverse problems of additive number theory, including sumsets (11P70) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (7)

A bilinear Bogolyubov-Ruzsa lemma with poly-logarithmic bounds ⋮ Approximate cohomology ⋮ Partition and analytic rank are equivalent over large fields ⋮ The structure theory of set addition revisited ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ An Additive Combinatorics Approach Relating Rank to Communication Complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The inverse conjecture for the Gowers norm over finite fields via the correspondence principle
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• A statistical theorem of set addition
• An inverse theorem for the uniformity seminorms associated with the action of \(\mathbb F_p^\infty\)
• SETS WITH SMALL SUMSET AND RECTIFICATION
• A Note on Freĭman's Theorem in Vector Spaces
• Freiman's Theorem in Finite Fields via Extremal Set Theory
• An equivalence between inverse sumset theorems and inverse conjectures for theU³norm
• A NOTE ON THE FREIMAN AND BALOG–SZEMERÉDI–GOWERS THEOREMS IN FINITE FIELDS
• AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM

This page was built for publication: Equivalence of polynomial conjectures in additive combinatorics