Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 1 Dec 2017 in math.CO | (1712.00241v1)

Abstract: A remarkable result of Bergelson, Tao and Ziegler implies that if $c>0$, $k$ is a positive integer, $p\geq k$ is a prime, $n$ is sufficiently large, and $f:\mathbb F_pn\to\mathbb C$ is a function with $|f|\infty\leq 1$ and $|f|{Uk}\geq c$, then there is a polynomial $\pi$ of degree at most $k-1$ such that $\mathbb E_xf(x)\omega{-\pi(x)}\geq c'$, where $\omega=\exp(2\pi 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.