A quantitative inverse theorem for the U4 norm over finite fields

Abstract

A remarkable result of Bergelson, Tao and Ziegler implies that if c>0, k is a positive integer, p≥ k is a prime, n is sufficiently large, and f: Fpn C is a function with \|f\|∞≤ 1 and \|f\|Uk≥ c, then there is a polynomial π of degree at most k-1 such that Exf(x)ω-π(x)≥ c', where ω=(2π i/p) and c'>0 is a constant that depends on c,k and p 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 c'. Here we give a different proof in the high-characteristic case when k=4, which enables us to give an explicit estimate for c'. The bound we obtain is roughly doubly exponential in the other parameters.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…