Breaking the 6/5 threshold for sums and products modulo a prime
Combinatorics
2018-06-20 v1 Number Theory
Abstract
Let of size at most . We show for . Our main tools are the cartesian product point--line incidence theorem of Stevens and de Zeeuw and the theory of higher energies developed by the second author.
Cite
@article{arxiv.1806.07091,
title = {Breaking the 6/5 threshold for sums and products modulo a prime},
author = {G. Shakan and I. D. Shkredov},
journal= {arXiv preprint arXiv:1806.07091},
year = {2018}
}