An inverse theorem for all finite abelian groups via nilmanifolds
Pablo Candela, Diego Gonz\'alez-S\'anchez, Bal\'azs Szegedy

TL;DR
This paper establishes a new inverse theorem for Gowers norms on all finite abelian groups using nilmanifolds, advancing the understanding of structured functions and their obstructions in additive combinatorics.
Contribution
It introduces a novel connection between CFR nilspaces and nilmanifolds, proving that every k-step CFR nilspace is a factor of a k-step nilmanifold, which is a key step in the inverse theorem.
Findings
Proves the inverse theorem for Gowers norms on all finite abelian groups.
Shows that k-step CFR nilspaces are factors of k-step nilmanifolds.
Provides applications in topological dynamics related to systems of order k.
Abstract
We prove a first inverse theorem for Gowers norms on all finite abelian groups that uses only nilmanifolds (rather than possibly more general nilspaces). This makes progress toward confirming the Jamneshan--Tao conjecture. The correlating function in our theorem is a projected nilsequence, obtained as the fiber-wise average of a nilsequence defined on a boundedly-larger abelian group extending the original abelian group. This result is tight in the following sense: we prove also that -step projected nilsequences of bounded complexity are genuine obstructions to having small Gowers -norm. This inverse theorem relies on a new result concerning compact finite-rank (CFR) nilspaces, which is the main contribution in this paper: every -step CFR nilspace is a factor of a -step nilmanifold. This new connection between the classical theory of nilmanifolds and the more recent…
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 · Advanced Graph Theory Research · Polynomial and algebraic computation
