Character Sums to Smooth Moduli are Small
From MaRDI portal
Publication:4933503
Abstract: Recently, Granville and Soundararajan have made fundamental breakthroughs in the study of character sums. Building on their work and using estimates on short character sums developed by Graham-Ringrose and Iwaniec, we improve the Polya-Vinogradov inequality for characters with smooth conductor.
Recommendations
- Large character sums
- Large values of character sums
- Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
- Lower bounds on odd order character sums
- Improving the Burgess bound via Pólya-Vinogradov
- The smoothed Pólya-Vinogradov inequality
- A Pólya-Vinogradov inequality for short character sums
- A remark on the least \(n\) with \(\chi(n) \not= 1\)
- Multiplicative mimicry and improvements to the Pólya-Vinogradov inequality
- scientific article; zbMATH DE number 54594
Cited in
(8)
- Short character sums for composite moduli
- Character sums with smooth numbers
- Burgess bounds for short character sums evaluated at forms
- The smoothed Pólya-Vinogradov inequality
- On character sums over flat numbers
- Pólya-Vinogradov and the least quadratic nonresidue
- Large character sums
- The distribution of the maximum of character sums
This page was built for publication: Character Sums to Smooth Moduli are Small
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933503)