An inverse theorem for the Gowers U^3 norm
Ben Green, Terence Tao

TL;DR
This paper provides a detailed analysis of the Gowers U^3 norm, characterizing functions with large norm, linking to ergodic theory, and applying results to bounds on arithmetic progressions in subsets of abelian groups.
Contribution
It offers a comprehensive description of functions with large U^3 norm and extends Gowers' results on Szemerédi's theorem, connecting additive combinatorics with ergodic theory.
Findings
Characterization of functions with large U^3 norm
Bound on the size of sets avoiding 4-term arithmetic progressions
Connections established with ergodic theory results
Abstract
The Gowers U^3 norm is one of a sequence of norms used in the study of arithmetic progressions. If G is an abelian group and A is a subset of G then the U^3(G) of the characteristic function 1_A is useful in the study of progressions of length 4 in A. We give a comprehensive study of the U^3(G) norm, obtaining a reasonably complete description of functions f : G -> C for which ||f||_{U^3} is large and providing links to recent results of Host, Kra and Ziegler in ergodic theory. As an application we generalise a result of Gowers on Szemeredi's theorem. Writing r_4(G) for the size of the largest set A not containing four distinct elements in arithmetic progression, we show that r_4(G) << |G|(loglog|G|)^{-c} for some absolute constant c. In future papers we will develop these ideas further, obtaining an asymptotic for the number of 4-term progressions p_1 < p_2 < p_3 < p_4 < N of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Graph theory and applications · Analytic Number Theory Research
