Quantitative bounds in the inverse theorem for the Gowers $U^{s+1}$-norms over cyclic groups
Frederick Manners

TL;DR
This paper presents a new proof for the inverse theorem of Gowers $U^{s+1}$-norms over cyclic groups, providing explicit quantitative bounds without relying on regularity or non-standard analysis, especially for $s \,\geq\, 3$.
Contribution
It introduces a novel proof technique that yields explicit bounds and avoids traditional complex methods for the inverse theorem in this setting.
Findings
Provides a new proof with double-exponential bounds
Eliminates the need for regularity or non-standard analysis
Applicable for $s \ge 3$ in cyclic groups
Abstract
We provide a new proof of the inverse theorem for the Gowers -norm over groups for prime. This proof gives reasonable quantitative bounds (the worst parameters are double-exponential), and in particular does not make use of regularity or non-standard analysis, both of which are new for in this setting.
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 Topology and Set Theory · Analytic Number Theory Research
