Search arXivSearch

arXiv · 2601.01682

General inverse theory for the $\mathsf{U}^4$ norm

Abstract

In this paper, we develop a quantitative inverse theory for the Gowers uniformity norm $\|\cdot\|_{\mathsf{U}^4}$ in general finite abelian groups. We identify a new type of obstructions to uniformity, which we call almost-cubic polynomials. An almost-cubic polynomial $q$ on a Bohr set $B(Γ, ρ_0)$ is a function such that, for each $ρ\leq \min\{ρ_0, 1/8\}$, we have \[\|Δ_{a,b,c,d} q(x)\|_{\mathbb{T}} \leq 2^{10} ρ\] for all $x, a,b,c,d \in B(Γ, ρ)$. Let $f : G \to \mathbb{D}$ be a function with $\|f\|_{\mathsf{U}^4} \geq c$. We prove quasipolynomial inverse theorems: $\bullet$ when $(|G|, 6) = 1$, there exists an almost-cubic $q : B(Γ, ρ)$ for $|Γ| \leq \log^{O(1)} c^{-1}$ and $ρ\geq \exp(-\log^{O(1)} c^{-1})$, and an element $t \in G$ such that $$\Big|\sum_{x \in G} 1_{B}(x) f(x + t) \operatorname{e}(q(x))\Big| \geq \exp(-\log^{O(1)} c^{-1})|G|,$$ $\bullet$ when $G = (\mathbb{Z}/2^d\mathbb{Z})^n$, there exists a cubic polynomial $q : G \to \mathbb{T}$ such that $$\Big|\sum_{x \in G} f(x)\operatorname{e}(q(x))\Big| \geq \exp(-\log^{O_d(1)} c^{-1})|G|.$$ Almost-cubic polynomials are rather rigid and we exhibit a strong connection with generalized polynomials in the case of cyclic groups, as well as with polynomials in the classical sense in the case of finite vector spaces. We also answer a question of Jamneshan, Shalom and Tao concerning the inverse theory in groups of bounded torsion. The central result from which the inverse theorems follow is a structural result for Freiman bihomomorphisms in general finite abelian groups. In our proof, we generalize methods of our previous work in the case of finite vector spaces and introduce novel ideas concerning extensions of Freiman bihomomorphisms. In the problem of extension of Freiman bihomomorphisms, genuinely new phenomena appear in general finite abelian groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luka Milićević. 2026-01-04. General inverse theory for the $\mathsf{U}^4$ norm. https://arxiv.org/abs/2601.01682

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO