Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 18 min ago
PreprintarXiv licencearXiv

Imaginary quadratic fields of class number at most 2000

Abstract

We determine all imaginary quadratic fields with class number at most 2000, unconditionally: there are 16,453,493 of them, and the largest |dK| among them is 1,062,350,083. To our knowledge, such a list was previously known only for class number at most 100. We make explicit a recent argument, released by OpenAI and not refereed, that excludes Landau-Siegel zeros: every real zero β of L(s,χ), for a primitive real character χ of conductor q≥3, satisfies (1−β)log q≥5.8·10−4. An elementary lower bound for L(1,χ) then shows that a field with class number at most 2000 has |dK|<1.61·1015. The fields with 6·228≤|dK|≤1.65·1015 are excluded by Watkins' sieve, and those below are read from the class group tables of Mosunov and Jacobson. As a consequence, the lists of Cremona and Sutherland of imaginary quadratic orders with class number at most 1000, and the counts of Holmin, Jones, Kurlberg, McLeman and Petersen for odd class numbers up to 1999, previously known under the generalized Riemann hypothesis, hold unconditionally. The two steps, the bound for β and the bound for |dK|, are proved in Lean, building on the existing formalization of that argument, and the proofs are checked by two independent kernels. The contributions of AI systems to this work are stated in the paper.

Related

  1. Admissible sets of integers in imaginary quadratic fields of class number 1
    Daniel Shiu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  2. p-class groups in the cyclotomic ℤp-extension of imaginary quadratic fields
    Somnath Jha, Debanjana Kundu, H. Laxmi +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  3. An infinite family of imaginary biquadratic fields with a large class number
    Kalyan Chakraborty, Pratik Rao, Aishwarya Dabhole
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. An additive problem in connection with some quadratic real fields with class number one
    Alexandru Gica
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. Fermat curves and explicit class field theory for real quadratic number fields
    Bora Yalkinoglu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
BibTeX
@misc{kimura2026imaginary,
  title = {{Imaginary quadratic fields of class number at most 2000}},
  author = {Iwao Kimura},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.21511},
  eprint = {2610.21511},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21511},
}
RIS
TY  - UNPB
TI  - Imaginary quadratic fields of class number at most 2000
AU  - Iwao Kimura
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.21511
UR  - https://arxiv.org/abs/2610.21511
AB  - We determine all imaginary quadratic fields with class number at most 2000, unconditionally: there are 16,453,493 of them, and the largest |d_K| among them is 1,062,350,083. To our knowledge, such a list was previously known only for class number at most 100. We make explicit a recent argument, released by OpenAI and not refereed, that excludes Landau-Siegel zeros: every real zero β of L(s,χ), for a primitive real character χ of conductor q≥3, satisfies (1−β)log q≥5.8·10^−4. An elementary lower bound for L(1,χ) then shows that a field with class number at most 2000 has |d_K|<1.61·10^15. The fields with 6·2^28≤|d_K|≤1.65·10^15 are excluded by Watkins' sieve, and those below are read from the class group tables of Mosunov and Jacobson. As a consequence, the lists of Cremona and Sutherland of imaginary quadratic orders with class number at most 1000, and the counts of Holmin, Jones, Kurlberg, McLeman and Petersen for odd class numbers up to 1999, previously known under the generalized Riemann hypothesis, hold unconditionally. The two steps, the bound for β and the bound for |d_K|, are proved in Lean, building on the existing formalization of that argument, and the proofs are checked by two independent kernels. The contributions of AI systems to this work are stated in the paper.
ER  -