Search arXivSearch

arXiv · 2311.13899

On the inverse theorem for Gowers norms in abelian groups of bounded torsion

Abstract

In recent work, Jamneshan, Shalom and Tao proved an inverse theorem for the Gowers $U^{k+1}$-norm on finite abelian groups of fixed torsion $m$, where the final correlating harmonic is a polynomial phase function of degree at most $C(k,m)$. They also posed a related central question, namely, whether the bound $C$ can be reduced to the optimal value $k$ for every $m$. We make progress on this question using nilspace theory. First we connect the question to the study of finite nilspaces whose structure groups have torsion $m$. Then we prove one of the main results of this paper: a primary decomposition theorem for finite nilspaces, extending the Sylow decomposition in group theory. Thus we give an analogue for nilspaces of an ergodic-theoretic Sylow decomposition in the aforementioned work of Jamneshan-Shalom-Tao. We deduce various consequences which illustrate the following general idea: the primary decomposition enables a reduction of higher-order Fourier analysis in the $m$-torsion setting to the case of abelian $p$-groups. These consequences include a positive answer to the question of Jamneshan-Shalom-Tao when $m$ is squarefree, and also a new relation between uniformity norms and certain generalized cut norms on products of abelian groups of coprime orders. Another main result in this paper is a positive answer to the above central question for the $U^3$-norm, proving that $C(2,m)=2$ for all $m$. Finally, we give a partial answer to the question for all $k$ and $m$, proving an inverse theorem involving extensions of polynomial phase functions which were introduced by the third-named author, known as projected phase polynomials of degree $k$. A notable aspect is that this inverse theorem implies that of Jamneshan-Shalom-Tao, while involving projected phase polynomials of degree $k$, which are genuine obstructions to having small $U^{k+1}$-norm.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pablo Candela, Diego González-Sánchez, Balázs Szegedy. 2023-12-14. On the inverse theorem for Gowers norms in abelian groups of bounded torsion. https://arxiv.org/abs/2311.13899

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO