OpenFrontiers
← Back to the index
OP-11986OpenNumber theory

A Prescribed Class-Group Structure for an Imaginary Quadratic Field

A Prescribed Class-Group Structure for an Imaginary Quadratic Field. Solid result problem from Epoch AI’s FrontierMath: Open Problems; answers are checked by a verifier program.

Epoch field label “Algebraic number theory” mapped to MSC2020 11R29 for A Prescribed Class-Group Structure for an Imaginary Quadratic Field. https://epoch.ai/frontiermath/open-problems/square-class-groups Not an author-supplied code.

Licensed source statementAs of Epoch AI data archive updated 2026-10-07; status as labeled by EpochSource & evidence ↓

Problem statement

The study of class groups of quadratic fields goes back to Gauss, whose conjectures about them have helped shape number theory for over two centuries. The size of the class group GG of the imaginary quadratic field with discriminant −D-D is known by Brauer–Siegel to be ≍D1/2+o(1)\asymp D^{1/2+o(1)}. The structure of these class groups is much more mysterious. Gauss’ genus theory allows us to determine the 22-torsion subgroup G[2]G[2] of GG, in terms of the number of prime factors of DD, but very little is known about other torsion pieces or the group structure as a whole. Since the structure of the 22-torsion subgroups of class groups is well understood, it is common to instead study the group C(D):=G/G[2]C(D):=G/G[2].

The Cohen–Lenstra heuristics provide a detailed framework to study the statistics of the groups C(D)C(D), and they predict that - keeping the size fixed groups HH should occur with frequency proportional to

1∣Aut⁡(H)∣.\frac{1}{|\operatorname{Aut}(H)|}.

Normalizing for Brauer–Siegel, we therefore expect a group HH of size to occur an expected ≍∣H∣2/∣Aut⁡(H)∣\asymp |H|^2/|\operatorname{Aut}(H)| number of times, at least on average over ∣H∣|H|. (This passes a quick sanity check: we expect most groups to be ~cyclic, and Z/nZ\mathbb{Z}/n\mathbb{Z} is predicted to occur ∼n\sim n times, which accounts for ∼X2\sim X^2 groups of size ≤X\leq X, in line with Brauer–Siegel.) Note that this heuristic (which goes beyond Cohen–Lenstra) is discussed in the work of Holmin, Jones, Kurlberg, McLeman, and Petersen; see also Soundararajan’s work on imaginary quadratic fields with a given class number.

Our question requires finding DD such that C(D)C(D) is isomorphic to (Z/nZ)2×(Z/n3Z)(\mathbb{Z}/n\mathbb{Z})^2\times(\mathbb{Z}/n^3\mathbb{Z}) for some nn. The size of this group is n5n^5 and the automorphism group of this group has size ∼n11\sim n^{11}. Thus the odds for each nn of this group occurring is ∼1n\sim \frac 1n, and we therefore expect this group to occur, on average, a constant number of times in each dyadic range. In particular, we expect that groups of this form occur infinitely often as C(D)C(D). We call such DD’s good.

Currently, it is completely unknown how to construct infinitely many quadratic fields while constraining the entire class group. The most famous example of this is the Gauss class number 11 conjecture for real quadratic fields: Gauss conjectured that there are infinitely many real quadratic fields with trivial class group, and this is completely open. Consequently, we (the authors of this problem) have no better way of finding good DD’s than by doing a brute force search. This becomes impractical in large ranges, where we expect good DD’s to become (logarithmically) sparse.

Empirical testing seems to be in rough accordance with the above: the set of good DD’s up to a billion is quite small – there are just 6565 of them. These include 1919 with n=2n=2, 3535 with n=3n=3, 99 with n=4n=4, and 22 with n=5n=5. These are also quite reasonably distributed in dyadic ranges. The top nine dyadic ranges going down from a billion contain respectively 1414, 99, 66, 55, 77, 77, 55, 44, and 77 occurrences of good DD’s, with just a single good DD below 595^9.

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Background

FrontierMath: Open Problems lists this problem with notability “Solid result”, field “Algebraic number theory” and type “Construction - Finite”. Each problem has a bespoke verifier program, so a proposed answer can be checked automatically.

Verifiable task — Epoch prompt, verbatim

Find three distinct positive squarefree integers D_1, D_2, and D_3 satisfying the
following properties:

- D_i > 10^40 for i in {1, 2, 3}.
- For each i in {1, 2, 3}, let K_i = Q(sqrt(-D_i)), and let

      G_i = Cl(K_i) / Cl(K_i)[2].

  Then

      G_i ≅ (Z/n_i Z)^2 x (Z/n_i^3 Z)

  for some integer n_i > 1.
- The integers n_1, n_2, and n_3 are pairwise distinct.

## Submission

Submit your three integers D_1, D_2, D_3 using the submit tool.

Progress & source assessment

Epoch lists this problem as unsolved in its data archive updated 7 October 2026. Earlier AI attempts are not displayed by Epoch.

References
  1. [1]Epoch AI, ‘FrontierMath: Open Problems’. Published online at epoch.ai. Retrieved from https://epoch.ai/frontiermath/open-problems (data updated 7 October 2026). — A Prescribed Class-Group Structure for an Imaginary Quadratic Field linkCC BY 4.0 (Epoch AI data and problem pages); attributed reproduction of problem descriptions and verbatim task prompts.

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.