Unconditional Class Group Tabulation of Imaginary Quadratic Fields to $|\Delta| < 2^{40}$
A. S. Mosunov, M. J. Jacobson Jr

TL;DR
This paper introduces an improved unconditional algorithm for computing class groups of imaginary quadratic fields with discriminants up to 2^40, extending previous bounds significantly and providing new data on class group structures.
Contribution
The authors develop a new method combining classical formulas and trace formulas to compute class groups unconditionally up to discriminant 2^40, surpassing previous limits.
Findings
Extended the discriminant bound from 2×10^{11} to 2^{40}.
Provided statistical data supporting conjectures about class groups.
Discovered new examples of class groups with exotic structures.
Abstract
We present an improved algorithm for tabulating class groups of imaginary quadratic fields of bounded discriminant. Our method uses classical class number formulas involving theta-series to compute the group orders unconditionally for all The group structure is resolved using the factorization of the group order. The case was handled using the methods of \cite{jacobson}, including the batch verification method based on the Eichler-Selberg trace formula to remove dependence on the Extended Riemann Hypothesis. Our new method enabled us to extend the previous bound of to . Statistical data in support of a variety conjectures is presented, along with new examples of class groups with exotic structures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Mathematical Dynamics and Fractals
