Large even order character sums
From MaRDI portal
Abstract: A classical theorem of Paley asserts the existence of an infinite family of quadratic characters whose character sums become exceptionally large. In this paper, we establish an analogous result for characters of any fixed even order. Previously our bounds were only known under the assumption of the Generalized Riemann Hypothesis.
Recommendations
- Large values of character sums
- Large character sums
- Long large character sums
- Large values of short character sums
- ON SOME MULTIPLE CHARACTER SUMS
- Lower bounds on odd order character sums
- The frequency and the structure of large character sums
- Character sums with subsequence sums
- Estimates for Character Sums
- Character sums with smooth numbers
Cites work
- A Theorem on Characters
- Exponential sums with multiplicative coefficients
- scientific article; zbMATH DE number 1542664 (Why is no real title available?)
- Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
- Lower bounds on odd order character sums
- Multiplicative mimicry and improvements to the Pólya-Vinogradov inequality
- Multiplicative number theory. I. Classical theory
Cited in
(12)- Large values of character sums
- The frequency and the structure of large character sums
- Large values of short character sums
- A refinement of the Burgess bound for character sums
- Large values of L(1,) for kth order characters and applications to character sums
- Lower bounds on odd order character sums
- Pólya-Vinogradov and the least quadratic nonresidue
- Improving the Burgess bound via Pólya-Vinogradov
- Large odd order character sums and improvements of the Pólya-Vinogradov inequality
- On the size of the maximum of incomplete Kloosterman sums
- Large sums of high‐order characters
- Sharp bounds for maximal sums of odd order Dirichlet characters
This page was built for publication: Large even order character sums
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189566)
