English

A quantitative inverse theorem for the $U^4$ norm over finite fields

Combinatorics 2017-12-04 v1

Abstract

A remarkable result of Bergelson, Tao and Ziegler implies that if c>0c>0, kk is a positive integer, pkp\geq k is a prime, nn is sufficiently large, and f:FpnCf:\mathbb F_p^n\to\mathbb C is a function with f1\|f\|_\infty\leq 1 and fUkc\|f\|_{U^k}\geq c, then there is a polynomial π\pi of degree at most k1k-1 such that Exf(x)ωπ(x)c\mathbb E_xf(x)\omega^{-\pi(x)}\geq c', where ω=exp(2πi/p)\omega=\exp(2\pi i/p) and c>0c'>0 is a constant that depends on c,kc,k and pp only. A version of this result for low-characteristic was also proved by Tao and Ziegler. The proofs of these results do not yield a lower bound for cc'. Here we give a different proof in the high-characteristic case when k=4k=4, which enables us to give an explicit estimate for cc'. The bound we obtain is roughly doubly exponential in the other parameters.

Keywords

Cite

@article{arxiv.1712.00241,
  title  = {A quantitative inverse theorem for the $U^4$ norm over finite fields},
  author = {W. T. Gowers and Luka Milićević},
  journal= {arXiv preprint arXiv:1712.00241},
  year   = {2017}
}

Comments

104 pages

R2 v1 2026-06-22T23:03:29.785Z