Enumeration of power sums modulo a prime
โ Scribed by Andrew M. Odlyzko; Richard P. Stanley
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 418 KB
- Volume
- 10
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In general , not every set of values modulo n will be the set of roots modulo n of some polynomial . In this note , some characteristics of those sets which are root sets modulo a prime power are developed , and these characteristics are used to determine the number of dif ferent sets of integers wh
AND WilLiam WebB Department of Mathematics, Washington State Unicersity, Pullman, Washington 99164-3113 Communicated hy Hans Zassenhaus
A subset R of the integers modulo n is defined to be a root set if it is the set of roots of some polynomial. Using the Chinese Remainder Theorem, the question of finding and counting root sets mod n is reduced to finding root sets modulo a prime power. In this paper, we provide a recursive construc
Let | be a prime in the quadratic field Q(e 2?iร3 ), and let G 3 (|) be the cubic Gauss sum. Matthews [Invent. Math. 52 (1979), 163 185; 54 (1979), 23 52] determined the product formula of G 3 (|) using Weierstrass' ^function. In this paper, we establish an analogous result for the cubic Gauss sum m