Abstract
Using techniques described in [3], we have computed the class number and class group structure of all imaginary quadratic fields with discriminant Δ for 0 < |Δ| < 1011. A novel verification algorithm based on the Eichler Selberg Trace Formula [15] was used to ensure that the correctness of our results does not rely on any unproved hypothesis. We present the results of our computations, and remark on specific evidence that was found pertaining to a number of heuristics. In particular, we present data which supports some of the Cohen-Lenstra heuristics [8], Littlewood’s bounds on L(1,χ) [14], and Bach’s bound on the maximum norm of the prime ideals required to generate the class group [1].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bach, E.: Explicit bounds for primality testing and related problems. Math. Comp. 55(191), 355–380 (1990)
Belabas, K.: On quadratic fields with large 3-rank. Math. Comp. 73, 2061–2074 (2004)
Buchmann, J., Jacobson Jr., M.J., Teske, E.: On some computational problems in finite abelian groups. Math. Comp. 66(220), 1663–1687 (1997)
Buchmann, J., Schmidt, A.: Computing the structure of a finite abelian group. Math. Comp. 74, 2017–2026 (2005)
Buell, D.A.: Small class numbers and extreme values of L-functions of quadratic fields. Math. Comp. 31(139), 786–796 (1977)
Buell, D.A.: The last exhaustive computation of class groups of complex quadratic number fields. In: Number theory (Ottawa, ON, 1996) (Providence, RI), CRM Proceedings and Lecture Notes, vol. 19, Amer. Math. Soc., pp. 35–53 (1999)
Cohen, H.: A course in computational algebraic number theory. Springer, Berlin (1993)
Cohen, H., Lenstra Jr., H.W.: Heuristics on class groups of number fields. In: Number Theory. Lecture notes in Math, vol. 1068, pp. 33–62. Springer, New York (1983)
Jacobson Jr., M.J.: Experimental results on class groups of real quadratic fields (extended abstract). In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 463–474. Springer, Heidelberg (1998)
Jacobson Jr., M.J.: Applying sieving to the computation of quadratic class groups. Math. Comp. 68(226), 859–867 (1999)
Jacobson Jr., M.J., Ramachandran, S., Williams, H.C.: Supplementary tables for Numerical results on class groups of imaginary quadratic fields (2006), http://www.math.tu-berlin.de/~kant/ants/proceedings.html
Leprévost, F.: Courbes modulaires et 11-rang de corps quadratiques. Experimental Mathematics 2(2), 137–146 (1993)
Leprévost, F.: The modular points of a genus 2 quotient of X 0(67). In: Proceedings of the 1997 Finite Field Conference of the AMS, Contemporary Mathematics, vol. 245, pp. 181–187 (1999)
Littlewood, J.E.: On the class number of the corpus P\((\surd- k)\). Proc. London Math. Soc. 27, 358–372 (1928)
Schoof, R., van der Vlugt, M.: Hecke operators and the weight distributions of certain codes. Journal of Combinatorial Theory, Series A 57, 163–186 (1991)
Shanks, D.: Class number, a theory of factorization, and genera. In: Proc. Sympos. Pure Math., AMS, Providence, R.I., pp. 415–440 (1971)
Shanks, D.: Systematic examination of Littlewood’s bounds on L(1,χ). In: Proc. Sympos. Pure Math., AMS, Providence, R.I., pp. 267–283 (1973)
Shanks, D.: On Gauss and composition I, II. In: Mollin, R.A. (ed.) Proc. NATO ASI on Number Theory and Applications, pp. 163–179. Kluwer Academic Press, Dordrecht (1989)
Shoup, V.: NTL: A library for doing number theory, Software (2001), See: http://www.shoup.net/ntl
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jacobson, M.J., Ramachandran, S., Williams, H.C. (2006). Numerical Results on Class Groups of Imaginary Quadratic Fields. In: Hess, F., Pauli, S., Pohst, M. (eds) Algorithmic Number Theory. ANTS 2006. Lecture Notes in Computer Science, vol 4076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11792086_7
Download citation
DOI: https://doi.org/10.1007/11792086_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36075-9
Online ISBN: 978-3-540-36076-6
eBook Packages: Computer ScienceComputer Science (R0)