On iterated product sets with shifts II
Brandon Hanson, Oliver Roche-Newton, Dmitrii Zhelezov

TL;DR
This paper proves that iterated product sets with shifts grow significantly in size over the rationals, establishes new sum-product bounds, and introduces a simplified approach using a polynomial Freiman-Ruzsa conjecture analogue.
Contribution
It provides new growth results for product sets with shifts, improves sum-product estimates, and simplifies the proof technique using a query-complexity analogue of the polynomial Freiman-Ruzsa conjecture.
Findings
Growth of iterated product sets with shifts over rationals
New sum-product estimate with bounded solutions
Partial structure theorem for point sets with many incidences
Abstract
The main result of this paper is the following: for all there exists such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite and any non-zero . 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 \[ c_1x + c_2y =1 ,\,\,\,\,\,\,\, (x,y) \in A \times A. \] 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.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Mathematical Dynamics and Fractals · Stochastic processes and statistical mechanics
