New mean value estimates for exponential sums over y-smooth numbers with y=(log x)^{K+o(1)} give a power saving over the trivial bound in an intermediate range, and yield a nontrivial bound on additive energy for K>12.
Exponential sums over integers without large prime divisors
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We obtain a new bound on exponential sums over integers without large prime divisors, improving that of Fouvry and Tenenbaum (1991). For a fixed integer $\nu\ne 0$, we also obtain new bounds on exponential sums with $\nu$-th powers of such integers. The improvement is based on exploiting more precisely the factorisation of integers without large prime divisors, along with existing Type~I and Type~II bounds. For $\nu=1$ we use the classical bounds of Vinogradov (1937), while for $\nu\neq 1$ we use bounds of Vaughan (1975) as well as of Fouvry, Kowalski and Michel (2014).
citation-role summary
citation-polarity summary
fields
math.NT 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Mean value theorems with smooth numbers
New mean value estimates for exponential sums over y-smooth numbers with y=(log x)^{K+o(1)} give a power saving over the trivial bound in an intermediate range, and yield a nontrivial bound on additive energy for K>12.