General inverse theory for the $\mathsf{U}^4$ norm
Luka Mili\'cevi\'c

TL;DR
This paper develops a quantitative inverse theory for the Gowers U^4 norm in finite abelian groups, introducing almost-cubic polynomials as obstructions to uniformity and establishing quasipolynomial inverse theorems.
Contribution
It introduces almost-cubic polynomials as new obstructions and proves quasipolynomial inverse theorems for the U^4 norm in general finite abelian groups.
Findings
Identification of almost-cubic polynomials as obstructions to uniformity
Quasipolynomial inverse theorem for groups with (|G|,6)=1
Existence of cubic polynomials for groups of the form (Z/2^dZ)^n
Abstract
In this paper, we develop a quantitative inverse theory for the Gowers uniformity norm in general finite abelian groups. We identify a new type of obstructions to uniformity, which we call almost-cubic polynomials. An almost-cubic polynomial on a Bohr set is a function such that, for each , we have \[\|\Delta_{a,b,c,d} q(x)\|_{\mathbb{T}} \leq 2^{10} \rho\] for all . Let be a function with . We prove quasipolynomial inverse theorems: when , there exists an almost-cubic for and , and an element such that $$\Big|\sum_{x \in G} 1_{B}(x) f(x + t) \operatorname{e}(q(x))\Big| \geq \exp(-\log^{O(1)}…
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 · Mathematical functions and polynomials · Polynomial and algebraic computation
