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

DOI10.4171/RMI/1328MaRDI QIDQ2157355zbMATHFDO

Authors Matteo Bordignon

Publication date 27 July 2022

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

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

zbMATH Keywords

partial Gaussian sumsPólya-Vinogradov inequality

Mathematics Subject Classification ID

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

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.

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; zbMATH DE number 54594
• An elementary proof of Pólya-Vinogradov's inequality

Cites work

• scientific article; zbMATH DE number 52979 (Why is no real title available?)
• A generalization of the Pólya-Vinogradov inequality
• A numerically explicit version of the Pólya-Vinogradov inequality
• An explicit Pólya-Vinogradov inequality via Partial Gaussian sums
• An investigation into explicit versions of Burgess' bound
• Approximate formulas for some functions of prime numbers
• 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
• Exponential sums with multiplicative coefficients
• Handbook of Number Theory I
• Hybrid bounds for Dirichlet L-functions
• Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
• Large values of character sums
• Montgomery's weighted sieve for dimension two
• Multiplicative mimicry and improvements to the Pólya-Vinogradov inequality
• On Character Sums and L-Series^†
• On the Constant in the Pólya-Vinogradov Inequality
• Remarks on the Pólya–Vinogradov Inequality
• The Burgess inequality and the least \(k\)th power non-residue
• The Character Sum Estimate with r = 3
• The large sieve

Cited in

(14)

• Trinomials, singular moduli and Riffaut's conjecture
• Character sums for primitive root densities
• An elementary proof of Pólya-Vinogradov's inequality
• An elementary proof of Pólya-Vinogradov's inequality. II
• A note on character sums
• Singular Gauss sums, Polya-Vinogradov inequality for \(\mathrm{GL}(2)\) and growth of primitive elements
• Short character sums and the Pólya-Vinogradov inequality
• An explicit Pólya-Vinogradov inequality via Partial Gaussian sums
• A Pólya-Vinogradov inequality for short character sums
• Large odd order character sums and improvements of the Pólya-Vinogradov inequality
• scientific article; zbMATH DE number 54594 (Why is no real title available?)
• Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
• A numerically explicit version of the Pólya-Vinogradov inequality
• On the Constant in the Pólya-Vinogradov Inequality

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)