A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
An explicit Pólya-Vinogradov inequality via Partial Gaussian sums
Tekijät: Matteo Bordignon, Bryce Kerr
Kustantaja: AMER MATHEMATICAL SOC
Julkaisuvuosi: 2020
Journal: Transactions of the American Mathematical Society
Tietokannassa oleva lehden nimi: TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
Lehden akronyymi: T AM MATH SOC
Vuosikerta: 373
Numero: 9
Aloitussivu: 6503
Lopetussivu: 6527
Sivujen määrä: 25
ISSN: 0002-9947
eISSN: 1088-6850
DOI: https://doi.org/10.1090/tran/8138
Tiivistelmä
In this paper we obtain a new fully explicit constant for the Polya-Vinogradov inequality for squarefree modulus. Given a primitive character chi to squarefree modulus q, we prove the following upper bound:vertical bar Sigma(1 <= n <= N) chi(n)vertical bar <= c root q log q,where c = 1/(2 pi(2)) + o(1) for even characters and c = 1/(4 pi) + o(1) for odd characters, with an explicit o(1) term. This improves a result of Frolenkov and Soundararajan for large q. We proceed via partial Gaussian sums rather than the usual Montgomery and Vaughan approach of exponential sums with multiplicative coefficients. This allows a power saving on the minor arcs rather than a factor of log q as in previous approaches and is an important factor for fully explicit bounds.
In this paper we obtain a new fully explicit constant for the Polya-Vinogradov inequality for squarefree modulus. Given a primitive character chi to squarefree modulus q, we prove the following upper bound:vertical bar Sigma(1 <= n <= N) chi(n)vertical bar <= c root q log q,where c = 1/(2 pi(2)) + o(1) for even characters and c = 1/(4 pi) + o(1) for odd characters, with an explicit o(1) term. This improves a result of Frolenkov and Soundararajan for large q. We proceed via partial Gaussian sums rather than the usual Montgomery and Vaughan approach of exponential sums with multiplicative coefficients. This allows a power saving on the minor arcs rather than a factor of log q as in previous approaches and is an important factor for fully explicit bounds.
Turun yliopiston Tutkimustietojärjestelmän portaali