Quasipolynomial Inverse Theorems

• Quasipolynomial inverse theorems are deep results in additive combinatorics that link large Gowers norms to algebraic or geometric structures with quasipolynomial parameter bounds.
• They leverage innovative techniques such as efficient equidistribution of nilsequences, bilinear Bogolyubov lemmas, and algebraic regularity to overcome previous exponential bounds.
• These advancements provide practical insights for density increment strategies and progressions in finite groups, enhancing applications in arithmetic combinatorics.

Quasipolynomial inverse theorems refer to a family of deep results in additive combinatorics characterizing functions with large Gowers uniformity norms through algebraic or geometric structures, where the essential quantitative parameters ("complexity," codimension, etc.) obey quasipolynomial rather than exponential-type bounds in the inverse norm parameter. Recent works establish these theorems for various settings—cyclic groups, vector spaces over finite fields, and general finite abelian groups—with dramatic improvements in parameter dependencies, using novel combinatorial, algebraic, and analytic machinery (Leng et al., 2024, Milićević, 2024, Milićević, 4 Jan 2026).

1. Definitions and Statement of Main Results

In the archetypal case, let $f:[N]\to\mathbb{C}$ be a bounded function with $\|f\|_{U^{s+1}[N]} \geq \delta$, for fixed $s\geq1$. The central result asserts the existence of a structured object—a nilsequence or a cubic phase—correlated with $f$, with explicit complexity bounds:

• There exists a connected, simply-connected nilpotent Lie group $G$ of degree $\le s$, a cocompact discrete subgroup $\Gamma$, a Mal’cev basis adapted to the filtration, a polynomial sequence $g:\mathbb{Z}\to G$ of degree $\le s$, and an $M$-Lipschitz nil-test function $F:G/\Gamma\to\mathbb{C}$, such that

$$\Bigl| \mathbb{E}_{n\in[N]} f(n)\,F\bigl(g(n)\,\Gamma\bigr) \Bigr| \geq 1/M$$

with $d = \dim G \leq (\log(1/\delta))^{O_s(1)}$ and $M \leq \exp((\log(1/\delta))^{O_s(1)})$ (Leng et al., 2024).

In the finite vector space setting $G=\mathbb{F}_p^n$, for $f:G \to \mathbb{D}$, $\|f\|_{U^4(G)} \ge c$, there exists a non-classical cubic polynomial $q:G\to\mathbb{T}$ such that

$$\Bigl| \mathbb{E}_{x\in G} f(x)\,e(-q(x)) \Bigr| \ge \exp(-C(p)\,(\log c^{-1})^{D}) \qquad [2410.08966],$$

with the correlation bound being quasipolynomial in $c^{-1}$.

For general finite abelian groups $G$ with $|G|$ coprime to $6$, the same structure arises, but in terms of "almost-cubic polynomials" on Bohr subsets, with Bohr parameters $|Γ| = O((\log c^{-1})^{O(1)})$, radius $ρ \ge \exp(-(\log c^{-1})^{O(1)})$, and with analogous correlation bounds (Milićević, 4 Jan 2026).

2. Quasipolynomial Bounds: Significance and Comparison

A function $M(\delta)$ is defined to be quasipolynomial in $1/\delta$ if $M(\delta) \le \exp((\log(1/\delta))^{a})$ for some exponent $a$. This is in stark contrast with prior results, where bounds for $U^{s+1}$-inverse theorems were of exponential-tower form: $M(\delta) \leq \exp(\exp(O_s(1/\delta)))$ or greater (Leng et al., 2024), [Man18]. Quasipolynomial improvement enables refined density increment strategies and longer progressions in applications to Szemerédi’s theorem, yielding subpower-type bounds for k-term APs for $k\geq5$.

3. Main Methodological Ingredients

(a) Efficient Equidistribution

Key quantitative inputs include quasipolynomial equidistribution theorems for nilsequences [Len23b] and almost-cubic polynomials. For nilmanifolds, these results produce tight control over correlation with structured objects and eliminate tower-type losses from earlier Green–Tao induction arguments.

(b) Abstract Balog–Szemerédi–Gowers Theorem

New combinatorial extensions of the BSG theorem operate in the algebraic context of partial or affine maps, replacing graph-theoretic structure with "approximate algebraic structure," facilitating robust passage from local to global information (Milićević, 2024).

(c) Bilinear Bogolyubov and Algebraic Regularity

Generalizations of Bogolyubov’s lemma to bilinear settings provide affine control of subspace structure; algebraic regularity lemmas yield coset decompositions and quasirandomness properties on bilinear varieties or Bohr sets, supporting multidimensional transference arguments (Milićević, 2024, Milićević, 4 Jan 2026).

(d) Freiman Bihomomorphisms

Structural results for Freiman bihomomorphisms on dense subsets allow the extension of partial bilinear maps to global approximate bihomomorphisms—crucial for passing from local correlations to global algebraic phases (Milićević, 4 Jan 2026).

4. Nilsequences, Polynomials, and Bohr Structures

The correlating objects in these results generalize classical phase polynomials:

• In $\mathbb{F}_p^n$, non-classical cubic polynomials and associated phases are characterized by vanishing fourth-order additive derivatives: $\forall h_1,h_2,h_3,h_4$, $$\Delta_{h_1}\Delta_{h_2}\Delta_{h_3}\Delta_{h_4}e(P(x)) = 1$$.
• In finite abelian groups, the obstruction is described by almost-cubic polynomials on Bohr sets, defined by approximate vanishing of the four-fold derivative, with precise control on Bohr frequencies and radii, reflecting rigidity and compatibility with classical polynomials in special cases (Milićević, 4 Jan 2026).
• For cyclic groups, the structure is captured by nilsequences from simply-connected nilmanifolds $G/\Gamma$, with degree and complexity governed by the quasipolynomial parameter.

5. Explicit Quantitative Structure and Applications

All the parameter losses at each step—codimension, rank, regularity, extension density—are individually quasipolynomial in the inverse norm parameter, yielding overall quasipolynomial correlation bounds. These theorems serve as quantitative substitutes for previous ergodic-theoretic or ultrafilter methods, enabling new density increment regimes for arithmetic progressions of length $k\ge 5$ [LSS24c], and resolving questions in bounded torsion group settings (Milićević, 4 Jan 2026).

6. Generalizations and Future Directions

The methodology generalizes to higher uniformity norms (e.g. $U^5$, $U^6$) in vector spaces and plausibly extends to arbitrary finite abelian groups and settings beyond additive combinatorics, contingent on further development of algebraic regularity and bilinear machinery (Milićević, 2024). The introduction of almost-cubic polynomial obstructions and E-bihomomorphism extensions suggests new intersections with non-abelian group theory and ergodic theory.

7. Central Lemmas and Structural Propositions

Several foundational results underpin these theorems:

• Bilinear Bogolyubov lemmas ensure small codimension Bohr varieties inside high-order difference sets with robust quantitative control (quasipolynomial dependencies).
• Algebraic regularity theorems for bilinear varieties grant fine-grained partitioning into structured and quasirandom components.
• Extension results for approximate Freiman-homomorphisms and equidistribution of multilinear phases enable liftings from dense local structures to global algebraic phases (Milićević, 4 Jan 2026).
• Classification results identify cubic polynomials in group settings; symmetry arguments show phase integration to polynomials under bounded torsion conditions.

Together, these ingredients complete a unified quasipolynomial inverse theory for Gowers norms in diverse group-theoretic environments, representing a substantial advance in additive combinatorics and its quantitative landscape (Leng et al., 2024, Milićević, 2024, Milićević, 4 Jan 2026).