Brandon Hanson, Oliver Roche-Newton and Dmitrii
Zhelezov
Vol. 14 (2020), No. 8, 2239–2260
DOI: 10.2140/ant.2020.14.2239
Abstract
The main result of this paper is the following: for all
there
exists
such that
for any finite
and any nonzero
.
Here,
denotes
the
-fold
product set
.
Furthermore, our method of proof also gives the following
sum-product
estimate. For all
there
exists a constant
such that for any
with
and
any
, there
are at most
solutions to
In particular, this result gives a strong bound when
, provided
that
is sufficiently small, and thus improves on previous bounds obtained via the Subspace
Theorem.
In further applications we give a partial structure theorem for point sets which
determine many incidences and prove that sum sets grow arbitrarily large by taking
sufficiently many products.
We utilize a query-complexity analogue of the polynomial Freiman–Ruzsa
conjecture, due to Pälvölgyi and Zhelezov (2020). This new tool replaces the role
of the complicated setup of Bourgain and Chang (2004), which we had previously
used. Furthermore, there is a better quantitative dependence between the
parameters.
PDF Access Denied
We have not been able to recognize your IP address
3.226.122.122
as that of a subscriber to this journal.
Online access to the content of recent issues is by
subscription, or purchase of single articles.
Please contact your institution's librarian suggesting a subscription, for example by using our
journal-recommendation form.
Or, visit our
subscription page
for instructions on purchasing a subscription.