Large character sums: Pretentious characters and the Polya-Vinogradov Theorem

Details Large character sums: Pretentious characters and the Polya-Vinogradov Theorem Large character sums: Pretentious characters and the Polya-Vinogradov Theorem

2005-03-06

arxiv.org/abs/math/0503113v1

Mathematics

Number Theory

29 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Large character sums: Pretentious characters and the Polya-Vinogradov Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Large character sums: Pretentious characters and the Polya-Vinogradov Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large character sums: Pretentious characters and the Polya-Vinogradov Theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-88554