Polynomial towers and inverse Gowers theory for bounded-exponent groups
Asgar Jamneshan, Or Shalom, Terence Tao

TL;DR
This paper extends inverse Gowers theory to bounded-exponent abelian groups, showing that their Host--Kra factors have polynomial tower structures, leading to a new inverse theorem for Gowers norms in these groups.
Contribution
It introduces polynomial towers for Host--Kra factors in bounded-exponent groups and proves an inverse Gowers norm theorem for such groups, resolving a key conjecture.
Findings
Host--Kra factors admit polynomial tower extensions
All such extensions are Abramov and k-step translational systems
Large Gowers norms imply correlation with low-degree polynomials
Abstract
In this paper we develop Host--Kra and inverse Gowers theory for abelian groups of bounded exponent. We show that the Host--Kra factors associated with actions of such groups admit extensions with the structure of \emph{polynomial towers}. This new notion is a system obtained as a finite iteration of abelian extensions of the trivial system by polynomial cocycles; crucially, the intermediate extensions in this system are not required to agree with the Host--Kra factors. We prove that all such extensions are Abramov (generalizing a recent result of Candela, Gonz\'alez-S\'anchez, and Szegedy), but not necessarily Weyl, and have the structure of k-step translational systems. Combining this structure theorem with a correspondence principle due to the first and third authors, we derive an inverse theorem for the Gowers norms on finite abelian groups of bounded…
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
TopicsAdvanced Differential Equations and Dynamical Systems · Polynomial and algebraic computation · Limits and Structures in Graph Theory
