Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 97 tok/s
Gemini 2.5 Pro 44 tok/s Pro
GPT-5 Medium 26 tok/s Pro
GPT-5 High 27 tok/s Pro
GPT-4o 100 tok/s Pro
GPT OSS 120B 464 tok/s Pro
Kimi K2 186 tok/s Pro
2000 character limit reached

Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers (1408.1662v1)

Published 7 Aug 2014 in math.NT, math.CA, and math.CO

Abstract: We investigate exponential sums over those numbers $\leq x$ all of whose prime factors are $\leq y$. We prove fairly good minor arc estimates, valid whenever $\log{3}x \leq y \leq 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 \leq y \leq 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 $\log{C}x \leq y \leq 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 \leq y \leq x$. This provides a deterministic set, of size $\approx x{1-c}$, inside which Roth's theorem holds.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)