Long large character sums
From MaRDI portal
Publication:6048799
Abstract: In this paper, we prove a lower bound for , when . This improves on a result of Granville and Soundararajan for large character sums when the range of summation is wide. When goes to zero, our lower bound recovers the expected maximal value of character sums for most characters.
Recommendations
Cites work
- Bump functions with monotone Fourier transforms satisfying decay bounds
- Gamma. Exploring Euler's constant. With a foreword by Freeman Dyson
- scientific article; zbMATH DE number 473229 (Why is no real title available?)
- scientific article; zbMATH DE number 1060876 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- Large character sums
- Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
- On Integers Free of Large Prime Factors
- The frequency and the structure of large character sums
- The resonance method for large character sums
Cited in
(10)- Large values of character sums
- The frequency and the structure of large character sums
- Large values of short character sums
- The maximum size of short character sums
- Large character sums
- Lower bounds on odd order character sums
- Large even order character sums
- The resonance method for large character sums
- The distribution of the maximum of character sums
- Sharp bounds for maximal sums of odd order Dirichlet characters
This page was built for publication: Long large character sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6048799)