Numerical Results on Class Groups of Imaginary Quadratic Fields

  • Michael J. JacobsonJr.
  • Shantha Ramachandran
  • Hugh C. Williams
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4076)


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].


Prime Ideal Class Group Class Number Cusp Form Congruence Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bach, E.: Explicit bounds for primality testing and related problems. Math. Comp. 55(191), 355–380 (1990)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Belabas, K.: On quadratic fields with large 3-rank. Math. Comp. 73, 2061–2074 (2004)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Buchmann, J., Jacobson Jr., M.J., Teske, E.: On some computational problems in finite abelian groups. Math. Comp. 66(220), 1663–1687 (1997)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Buchmann, J., Schmidt, A.: Computing the structure of a finite abelian group. Math. Comp. 74, 2017–2026 (2005)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Buell, D.A.: Small class numbers and extreme values of L-functions of quadratic fields. Math. Comp. 31(139), 786–796 (1977)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Cohen, H.: A course in computational algebraic number theory. Springer, Berlin (1993)MATHGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    Jacobson Jr., M.J.: Applying sieving to the computation of quadratic class groups. Math. Comp. 68(226), 859–867 (1999)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Jacobson Jr., M.J., Ramachandran, S., Williams, H.C.: Supplementary tables for Numerical results on class groups of imaginary quadratic fields (2006),
  12. 12.
    Leprévost, F.: Courbes modulaires et 11-rang de corps quadratiques. Experimental Mathematics 2(2), 137–146 (1993)MATHMathSciNetGoogle Scholar
  13. 13.
    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)Google Scholar
  14. 14.
    Littlewood, J.E.: On the class number of the corpus P\((\surd- k)\). Proc. London Math. Soc. 27, 358–372 (1928)CrossRefMathSciNetGoogle Scholar
  15. 15.
    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)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Shanks, D.: Class number, a theory of factorization, and genera. In: Proc. Sympos. Pure Math., AMS, Providence, R.I., pp. 415–440 (1971)Google Scholar
  17. 17.
    Shanks, D.: Systematic examination of Littlewood’s bounds on L(1,χ). In: Proc. Sympos. Pure Math., AMS, Providence, R.I., pp. 267–283 (1973)Google Scholar
  18. 18.
    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)Google Scholar
  19. 19.
    Shoup, V.: NTL: A library for doing number theory, Software (2001), See:

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Michael J. JacobsonJr.
    • 1
  • Shantha Ramachandran
    • 1
  • Hugh C. Williams
    • 1
  1. 1.Department of Computer ScienceUniversity of CalgaryCalgary, AlbertaCanada

Personalised recommendations