Large character sums: Pretentious characters and the Polya-Vinogradov Theorem
| dc.creator | Granville, Andrew | |
| dc.creator | Soundararajan, K. | |
| dc.date | 2005-03-06 | |
| dc.date.accessioned | 2026-07-07T05:17:44Z | |
| dc.date.available | 2026-07-07T05:17:44Z | |
| dc.description | In 1918 Polya and Vinogradov gave an upper bound for the maximal size of character sums which still remains the best known general estimate. One of the main results of this paper provides a substantial improvement of the Polya-Vinogradov bound for characters of odd, bounded order. In 1977 Montgomery and Vaughan showed how the Polya-Vinogradov inequality may be sharpened assuming the GRH. We give a simple proof of their estimate, and provide an improvement for characters of odd, bounded order. The paper also gives characterizations of the characters for which the maximal character sum is large, and finds a hidden structure among these characters. | |
| dc.description | 29 pages | |
| dc.identifier | https://arxiv.org/abs/math/0503113 | |
| dc.identifier | http://arxiv.org/abs/math/0503113 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/74413 | |
| dc.subject | Number Theory | |
| dc.title | Large character sums: Pretentious characters and the Polya-Vinogradov Theorem | |
| dc.type | text |