Partial Gaussian sums and the Pólya-Vinogradov inequality for primitive characters

DOI10.4171/RMI/1328zbMATH Open1501.11084arXiv2001.05114MaRDI QIDQ2157355FDOQ2157355

Matteo Bordignon

Publication date: 27 July 2022

Published in: Revista Matemática Iberoamericana (Search for Journal in Brave)

Abstract: In this paper we obtain a new fully explicit constant for the P'olya-Vinogradov inequality for primitive characters. Given a primitive character $chi$ modulo $q$, we prove the following upper bound �egin{align*} left| sum_{1 le nle N} chi(n) ight|le c sqrt{q} log q, end{align*} where $c=3/(4p{i}^2)+o_q(1)$ for even characters and $c=3/(8pi)+o_q(1)$ for odd characters, with explicit $o_q(1)$ terms. This improves a result of Frolenkov and Soundararajan for large $q$. We proceed, following Hildebrand, obtaining the explicit version of a result by Montgomery--Vaughan on partial Gaussian sums and an explicit Burgess-like result on convoluted Dirichlet characters.

Full work available at URL: https://arxiv.org/abs/2001.05114

Recommendations

• An explicit Pólya-Vinogradov inequality via Partial Gaussian sums
• Short character sums and the Pólya-Vinogradov inequality
• On the Constant in the Pólya-Vinogradov Inequality
• scientific article
• An elementary proof of Pólya-Vinogradov's inequality

zbMATH Keywords

partial Gaussian sumsPólya-Vinogradov inequality

Mathematics Subject Classification ID

Gauss and Kloosterman sums; generalizations (11L05) Estimates on character sums (11L40)

Cites Work

• Remarks on the Pólya–Vinogradov Inequality
• Exponential sums with multiplicative coefficients
• Handbook of Number Theory I
• The large sieve
• Title not available (Why is that?)
• Approximate formulas for some functions of prime numbers
• Large values of character sums
• On Character Sums and L-Series^†
• Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
• Multiplicative mimicry and improvements to the Pólya-Vinogradov inequality
• Hybrid bounds for Dirichlet L-functions
• A generalization of the Pólya-Vinogradov inequality
• On the Constant in the Pólya-Vinogradov Inequality
• A numerically explicit version of the Pólya-Vinogradov inequality
• The Character Sum Estimate with r = 3
• Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
• Explicit bounds for primes in arithmetic progressions
• Montgomery's weighted sieve for dimension two
• The Burgess inequality and the least kth power non-residue
• An investigation into explicit versions of Burgess' bound
• An explicit Pólya-Vinogradov inequality via Partial Gaussian sums

Cited In (10)

• Title not available (Why is that?)
• An explicit Pólya-Vinogradov inequality via Partial Gaussian sums
• Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
• On the Constant in the Pólya-Vinogradov Inequality
• Character sums for primitive root densities
• An elementary proof of Pólya-Vinogradov's inequality. II
• An elementary proof of Pólya-Vinogradov's inequality
• Large odd order character sums and improvements of the Pólya-Vinogradov inequality
• Trinomials, singular moduli and Riffaut's conjecture
• A note on character sums

This page was built for publication: Partial Gaussian sums and the Pólya-Vinogradov inequality for primitive characters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2157355)