Abstract

We investigate exponential sums over those numbers ${\leqslant}x$ all of whose prime factors are ${\leqslant}y$. We prove fairly good minor arc estimates, valid whenever $\log ^{3}x\leqslant y\leqslant x^{1/3}$. Then we prove sharp upper bounds for the $p$th moment of (possibly weighted) sums, for any real $p>2$ and $\log ^{C(p)}x\leqslant y\leqslant x$. Our proof develops an argument of Bourgain, showing that this can succeed without strong major arc information, and roughly speaking it would give sharp moment bounds and restriction estimates for any set sufficiently factorable relative to its density. By combining our bounds with major arc estimates of Drappeau, we obtain an asymptotic for the number of solutions of $a+b=c$ in $y$-smooth integers less than $x$ whenever $\log ^{C}x\leqslant y\leqslant x$. Previously this was only known assuming the generalised Riemann hypothesis. Combining them with transference machinery of Green, we prove Roth’s theorem for subsets of the $y$-smooth numbers whenever $\log ^{C}x\leqslant y\leqslant x$. This provides a deterministic set, of size ${\approx}x^{1-c}$, inside which Roth’s theorem holds.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.