×

Weber’s class invariants. (English) Zbl 0226.12005

The author considers problems related to Gauss’ “10th discriminant problem”. He makes use of theorems of class field theory and establishes in this way, for instance, Heegner’s unproved assertions because of which K. Heegner’s work [Math. Z. 56, 227–253 (1952; Zbl 0049.16202)] was at first disbelieved.
The author also introduces new points of view to questions which recently have been considered, for instance, by A. Baker [Mathematika 13, No. 2, 204–216 (1966; Zbl 0161.05201)], K. Ramachandra [Ann. Math. (2) 80, 104–148 (1964; Zbl 0142.29804)] and H. M. Stark [Mich. Math. J. 14, 1–27 (1967; Zbl 0148.27802)] and he gives a good summary of the results of this field.

MSC:

11R29 Class numbers, class groups, discriminants
11R37 Class field theory
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] DOI: 10.1007/BF01174749 · Zbl 0049.16202
[2] Klein, Vorlesungen über die Theorie der elliptischen Modulfunktionen (1890)
[3] DOI: 10.1007/BF01700702 · Zbl 0002.33002
[4] Fricke, Lehrbuch der Algebra (1928)
[5] DOI: 10.1007/BF01425548 · Zbl 0155.38001
[6] Deuring, Enz. Math. Wiss. Band I 10 (1958)
[7] DOI: 10.1007/BF02940746 · Zbl 0025.02003
[8] Birch, Proceedings of the Conference on Algebraic Geometry pp 35– (1968)
[9] Baker, Mathematika 13 pp 204– (1966)
[10] Weber, Lehrbuch der Algebra III (1908)
[11] DOI: 10.1112/plms/s2-42.1.398 · Zbl 0016.10201
[12] DOI: 10.1307/mmj/1028999653 · Zbl 0148.27802
[13] DOI: 10.1007/BF01472223 · Zbl 0012.00902
[14] DOI: 10.1007/BF01425549 · Zbl 0175.33602
[15] Siegel, Tata Institute Lecture Notes 23 (1961)
[16] Ramanujan, Quart J. of Math. 45 pp 350– (1914)
[17] DOI: 10.2307/1970494 · Zbl 0142.29804
[18] Hasse, Algebraic Number Theory, ed pp 266– (1967)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.