Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers

Abstract

We investigate exponential sums over those numbers ≤ x all of whose prime factors are ≤ y. We prove fairly good minor arc estimates, valid whenever 3x ≤ y ≤ x1/3. Then we prove sharp upper bounds for the p-th moment of (possibly weighted) sums, for any real p > 2 and C(p)x ≤ y ≤ x. Our proof develops an argument of Bourgain, showing 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 Cx ≤ y ≤ 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 Cx ≤ y ≤ x. This provides a deterministic set, of size ≈ x1-c, inside which Roth's theorem holds.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…