Nair-Tenenbaum bounds uniform with respect to the discriminant
arXiv:1102.1643 · doi:10.1017/S0305004111000752
Abstract
A common problem in analytic number theory is to bound the sum of an arithmetic function over a set of integers. Nair and Tenenbaum found a very general bound that applies to short sums of a multivariable arithmetic function over polynomial values, under certain standard conditions on the growth of that function. Their bound features an implicit dependency on the discriminant of the relevant polynomial. In our paper we obtain an analogous bound with an explicit dependency on the discriminant, which is optimal in the discriminant aspect.
20 pages
References in corpus (2)
Cited by in corpus (21)
- Sums of Kloosterman sums in arithmetic progressions, and the error term in the dispersion method
- Correlations of the von Mangoldt and higher divisor functions I. Long shift ranges
- Linear correlations of multiplicative functions
- Higher uniformity of arithmetic functions in short intervals I. All intervals
- Combinatorial identities and Titchmarsh's divisor problem for multiplicative functions
- Lois locales de la fonction dans presque tous les petits intervalles
- Partial sums of typical multiplicative functions over short moving intervals
- Sign changes of Hecke eigenvalues
- Multiplicative functions in short intervals II
- On the Hardy-Littlewood-Chowla conjecture on average
- Averages of the Möbius function on shifted primes
- Correlations of the von Mangoldt and higher divisor functions II. Divisor correlations in short ranges
- Sur le nombre d'idéaux dont la norme est la valeur d'une forme binaire de degré 3
- On the Moments of the Number of Representations as Sums of Two Prime Squares
- Superscars for Arithmetic Point Scatterers II
- Averages of arithmetic functions over principal ideals
- The sixth moment of the Riemann zeta function and ternary additive divisor sums
- The Chowla conjecture and Landau-Siegel zeroes
- Quadratic Hecke sums and mass equidistribution
- Mean values of arithmetic functions and application to sums of powers
- Higher order divisor problems