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 , is a positive integer, is a prime, is sufficiently large, and is a function with and , then there is a polynomial of degree at most such that , where and is a constant that depends on and 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 . Here we give a different proof in the high-characteristic case when , which enables us to give an explicit estimate for . The bound we obtain is roughly doubly exponential in the other parameters.
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