fbpx
Wikipedia

Character sum

In mathematics, a character sum is a sum of values of a Dirichlet character χ modulo N, taken over a given range of values of n. Such sums are basic in a number of questions, for example in the distribution of quadratic residues, and in particular in the classical question of finding an upper bound for the least quadratic non-residue modulo N. Character sums are often closely linked to exponential sums by the Gauss sums (this is like a finite Mellin transform).

Assume χ is a non-principal Dirichlet character to the modulus N.

Sums over ranges edit

The sum taken over all residue classes mod N is then zero. This means that the cases of interest will be sums   over relatively short ranges, of length R < N say,

 

A fundamental improvement on the trivial estimate   is the Pólya–Vinogradov inequality, established independently by George Pólya and I. M. Vinogradov in 1918,[1][2] stating in big O notation that

 

Assuming the generalized Riemann hypothesis, Hugh Montgomery and R. C. Vaughan have shown[3] that there is the further improvement

 

Summing polynomials edit

Another significant type of character sum is that formed by

 

for some function F, generally a polynomial. A classical result is the case of a quadratic, for example,

 

and χ a Legendre symbol. Here the sum can be evaluated (as −1), a result that is connected to the local zeta-function of a conic section.

More generally, such sums for the Jacobi symbol relate to local zeta-functions of elliptic curves and hyperelliptic curves; this means that by means of André Weil's results, for N = p a prime number, there are non-trivial bounds

 

The constant implicit in the notation is linear in the genus of the curve in question, and so (Legendre symbol or hyperelliptic case) can be taken as the degree of F. (More general results, for other values of N, can be obtained starting from there.)

Weil's results also led to the Burgess bound,[4] applying to give non-trivial results beyond Pólya–Vinogradov, for R a power of N greater than 1/4.

Assume the modulus N is a prime.

 

for any integer r ≥ 3.[5]

Notes edit

References edit

  • Pólya, George (1918). "Ueber die Verteilung der quadratischen Reste und Nichtreste". Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen: 21–29. JFM 46.0265.02.
  • Vinogradov, Ivan Matveyevich (1918). "Sur la distribution des residus and nonresidus des puissances". J. Soc. Phys. Math. Univ. Permi: 18–28. JFM 48.1352.04.
  • Burgess, D. A. (1957). "The distribution of quadratic residues and non-residues". Mathematika. 4 (2): 106–112. doi:10.1112/S0025579300001157. Zbl 0081.27101.
  • Montgomery, Hugh L.; Vaughan, Robert C. (1977). "Exponential sums with multiplicative coefficients" (PDF). Inventiones Mathematicae. 43 (1): 69–82. Bibcode:1977InMat..43...69M. doi:10.1007/BF01390204. hdl:2027.42/46603. Zbl 0362.10036.
  • Montgomery, Hugh L.; Vaughan, Robert C. (2007). Multiplicative number theory I. Classical theory. Cambridge tracts in advanced mathematics. Vol. 97. Cambridge University Press. pp. 306–325. ISBN 978-0-521-84903-6. Zbl 1142.11001.

Further reading edit

  • Korobov, N. M. (1992). Exponential sums and their applications. Mathematics and Its Applications (Soviet Series). Vol. 80. Translated from the Russian by Yu. N. Shakhov. Dordrecht: Kluwer Academic Publishers. ISBN 0-7923-1647-9. Zbl 0754.11022.

External links edit

character, mathematics, character, textstyle, values, dirichlet, character, modulo, taken, over, given, range, values, such, sums, basic, number, questions, example, distribution, quadratic, residues, particular, classical, question, finding, upper, bound, lea. In mathematics a character sum is a sum x n textstyle sum chi n of values of a Dirichlet character x modulo N taken over a given range of values of n Such sums are basic in a number of questions for example in the distribution of quadratic residues and in particular in the classical question of finding an upper bound for the least quadratic non residue modulo N Character sums are often closely linked to exponential sums by the Gauss sums this is like a finite Mellin transform Assume x is a non principal Dirichlet character to the modulus N Contents 1 Sums over ranges 2 Summing polynomials 3 Notes 4 References 5 Further reading 6 External linksSums over ranges editThe sum taken over all residue classes mod N is then zero This means that the cases of interest will be sums S displaystyle Sigma nbsp over relatively short ranges of length R lt N say M n lt M R displaystyle M leq n lt M R nbsp A fundamental improvement on the trivial estimate S O N displaystyle Sigma O N nbsp is the Polya Vinogradov inequality established independently by George Polya and I M Vinogradov in 1918 1 2 stating in big O notation that S O N log N displaystyle Sigma O sqrt N log N nbsp Assuming the generalized Riemann hypothesis Hugh Montgomery and R C Vaughan have shown 3 that there is the further improvement S O N log log N displaystyle Sigma O sqrt N log log N nbsp Summing polynomials editAnother significant type of character sum is that formed by x F n displaystyle sum chi F n nbsp for some function F generally a polynomial A classical result is the case of a quadratic for example F n n n 1 displaystyle F n n n 1 nbsp and x a Legendre symbol Here the sum can be evaluated as 1 a result that is connected to the local zeta function of a conic section More generally such sums for the Jacobi symbol relate to local zeta functions of elliptic curves and hyperelliptic curves this means that by means of Andre Weil s results for N p a prime number there are non trivial bounds O p displaystyle O sqrt p nbsp The constant implicit in the notation is linear in the genus of the curve in question and so Legendre symbol or hyperelliptic case can be taken as the degree of F More general results for other values of N can be obtained starting from there Weil s results also led to the Burgess bound 4 applying to give non trivial results beyond Polya Vinogradov for R a power of N greater than 1 4 Assume the modulus N is a prime S p 1 2 log p S 2 R 1 2 p 3 16 log p S r R 1 1 r p r 1 4 r 2 log p 1 2 r displaystyle begin aligned Sigma amp ll p 1 2 log p 6pt Sigma amp ll 2R 1 2 p 3 16 log p 6pt Sigma amp ll rR 1 1 r p r 1 4r 2 log p 1 2r end aligned nbsp for any integer r 3 5 Notes edit Polya 1918 Vinogradov 1918 Montgomery amp Vaughan 1977 Burgess 1957 Montgomery amp Vaughan 2007 p 315 References editPolya George 1918 Ueber die Verteilung der quadratischen Reste und Nichtreste Nachrichten von der Gesellschaft der Wissenschaften zu Gottingen 21 29 JFM 46 0265 02 Vinogradov Ivan Matveyevich 1918 Sur la distribution des residus and nonresidus des puissances J Soc Phys Math Univ Permi 18 28 JFM 48 1352 04 Burgess D A 1957 The distribution of quadratic residues and non residues Mathematika 4 2 106 112 doi 10 1112 S0025579300001157 Zbl 0081 27101 Montgomery Hugh L Vaughan Robert C 1977 Exponential sums with multiplicative coefficients PDF Inventiones Mathematicae 43 1 69 82 Bibcode 1977InMat 43 69M doi 10 1007 BF01390204 hdl 2027 42 46603 Zbl 0362 10036 Montgomery Hugh L Vaughan Robert C 2007 Multiplicative number theory I Classical theory Cambridge tracts in advanced mathematics Vol 97 Cambridge University Press pp 306 325 ISBN 978 0 521 84903 6 Zbl 1142 11001 Further reading editKorobov N M 1992 Exponential sums and their applications Mathematics and Its Applications Soviet Series Vol 80 Translated from the Russian by Yu N Shakhov Dordrecht Kluwer Academic Publishers ISBN 0 7923 1647 9 Zbl 0754 11022 External links editWeisstein Eric W The Polya Vinogradov inequality MathWorld PlanetMath article on the Polya Vinogradov inequality Retrieved from https en wikipedia org w index php title Character sum amp oldid 1158538603, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.