Search arXivSearch

arXiv · 0810.5527

The inverse conjecture for the Gowers norm over finite fields via the correspondence principle

Abstract

The inverse conjecture for the Gowers norms $U^d(V)$ for finite-dimensional vector spaces $V$ over a finite field $\F$ asserts, roughly speaking, that a bounded function $f$ has large Gowers norm $\|f\|_{U^d(V)}$ if and only if it correlates with a phase polynomial $ϕ= e_\F(P)$ of degree at most $d-1$, thus $P: V \to \F$ is a polynomial of degree at most $d-1$. In this paper, we develop a variant of the Furstenberg correspondence principle which allows us to establish this conjecture in the large characteristic case $\charac(F) \geq d$ from an ergodic theory counterpart, which was recently established by Bergelson and the authors. In low characteristic we obtain a partial result, in which the phase polynomial $ϕ$ is allowed to be of some larger degree $C(d)$. The full inverse conjecture remains open in low characteristic; the counterexamples by Lovett-Meshulam-Samorodnitsky or Green-Tao in this setting can be avoided by a slight reformulation of the conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Terence Tao, Tamar Ziegler. 2009-10-29. The inverse conjecture for the Gowers norm over finite fields via the correspondence principle. https://doi.org/10.2140/apde.2010.3.1

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