A numerically explicit version of the Pólya-Vinogradov inequality

zbMATH Open1302.11054arXiv1107.0381MaRDI QIDQ446290FDOQ446290

Authors: Dmitriy Frolenkov 

Publication date: 5 September 2012

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Abstract: In this paper we proved a new numerically explicit version of the P'{o}lya--Vinogradov inequality. Our proof is based on the new ideas of V.A. Bykovskii and improves a recent inequality obtained by C. Pomerance.

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

Recommendations

• Remarks on the Pólya–Vinogradov Inequality
• A generalization of the Pólya-Vinogradov inequality
• Short character sums and the Pólya-Vinogradov inequality
• An elementary proof of Pólya-Vinogradov's inequality
• Partial Gaussian sums and the Pólya-Vinogradov inequality for primitive characters

zbMATH Keywords

Dirichlet charactercharacter sumsPólya-Vinogradov inequality

Mathematics Subject Classification ID

Estimates on character sums (11L40)

Cited In (6)

• An explicit Pólya-Vinogradov inequality via Partial Gaussian sums
• A numerical experiment related to Zolotarev polynomials for weighted sup-norm
• Partial Gaussian sums and the Pólya-Vinogradov inequality for primitive characters
• Character sums over shifted powers
• On the constant in the Pólya-Vinogradov inequality
• A generalization of the Pólya-Vinogradov inequality

This page was built for publication: A numerically explicit version of the Pólya-Vinogradov inequality

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