A theorem of G. Poร lya states that an entire function of exponential order less than 1 or of exponential order 1 and type less then log 2 which takes integer values on the set N of nonnegative integers is a polynomial. The bound log 2 is the best possible since the map z [ 2 Z is not a polynomial a
โฆ LIBER โฆ
Gauss sums forFq[T]
โ Scribed by Dinesh S. Thakur
- Book ID
- 105176593
- Publisher
- Springer-Verlag
- Year
- 1988
- Tongue
- English
- Weight
- 323 KB
- Volume
- 94
- Category
- Article
- ISSN
- 0020-9910
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Pรฒlya's Theorem forFq[T]
โ
Mireille Car
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 384 KB
Half Gauss sums
โ
Bruce C. Berndt; Ronald J. Evans
๐
Article
๐
1980
๐
Springer
๐
English
โ 397 KB
Quadratic Gauss Sums
โ
Oumar D. Mbodj
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 319 KB
Let p be a prime integer and m be an integer, not divisible by p. Let K be the splitting field of XK!1 over the prime field % N . Solving the Gauss sums problem of order m in characteristic p means determining Gauss sums of all multiplicative characters of K of order dividing m. Our aim is to solve
Equidistribution of Gauss sums and Kloos
โ
Lei Fu; Chunlei Liu
๐
Article
๐
2004
๐
Springer-Verlag
๐
French
โ 162 KB
Continued fraction for the exponential f
โ
Dinesh S. Thakur
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 256 KB
NMR implementations of Gauss sums
โ
Jonathan A. Jones
๐
Article
๐
2008
๐
Elsevier Science
๐
English
โ 99 KB