Gauss sums and elliptic functions: II. The quartic sum
β Scribed by C. R. Matthews
- Publisher
- Springer-Verlag
- Year
- 1979
- Tongue
- English
- Weight
- 1000 KB
- Volume
- 54
- Category
- Article
- ISSN
- 0020-9910
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we give a new proof of the Iwasawa main conjecture using the Euler systems of Gauss sums. Our proof is different from that of Mazur and Wiles and that of Rubin and Greither. Rubin's proof used the Euler systems of cyclotomic units and the plus part of the ideal class groups. Instead o
Let T be a finite subset of the integers. Let sum(T) denote the sum of the elements of T. We use this function to construct a decomposition of the edges of the subgraph of N and N + 1 ranked subsets of a 2N + 1 set into a disjoint union of matchings.
The Fast Gauss Transform is an algorithm for summing a series of Gaussians which is sometimes much faster than direct summation. Gaussian series in d dimensions are of the form P N jΒΌ1 k j expΓ°ΓΒ½a=h 2 kx Γ x j k 2 Γ where the x j are the centers, h is the average separation between centers and a is