Simplest cubic fields with small class number

Akinari Hoshi; Hiroaki Iida

arxiv: 2603.18802 · v2 · submitted 2026-03-19 · 🧮 math.NT

Simplest cubic fields with small class number

Akinari Hoshi , Hiroaki Iida This is my paper

Pith reviewed 2026-05-15 08:39 UTC · model grok-4.3

classification 🧮 math.NT

keywords simplest cubic fieldsclass numbercubic number fieldsconductorindex of ring of integersPARI computationsmonic cubic polynomial

0 comments

The pith

Computations confirm exactly 581 simplest cubic fields with index 1 have class number at most 1000.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines the infinite family of simplest cubic fields L_m defined by the minimal polynomial X^3 - m X^2 - (m+3) X - 1. It focuses on cases where the index of the ring of integers over the power basis Z[alpha] equals 1, 3 or 27, which correspond to the conductor equaling m^2 + 3m + 9 or a small multiple of it. Using PARI/GP the authors count how many such fields have class number h_m at most 1000 and obtain the exact totals 581, 80 and 142 respectively. They also enumerate all members of the family with m up to 10 million whose class numbers are smaller than 16, giving explicit counts for each possible small value. The results supply concrete, verifiable lists for the smallest class numbers appearing in this family.

Core claim

If the index [O_{L_m} : Z[alpha]] equals 1 then exactly 581 integers m >= -1 satisfy h_m <= 1000; the corresponding counts are 80 when the index equals 3 and 142 when the index equals 27. For -1 <= m <= 10^7 the class number is less than 16 for exactly 138 values of m, with 26 fields having h_m = 1, 31 having h_m = 3, 11 having h_m = 4, 10 having h_m = 7, 36 having h_m = 9, 21 having h_m = 12 and 3 having h_m = 13, all listed explicitly.

What carries the argument

The monic cubic polynomial f_m(X) = X^3 - m X^2 - (m+3) X - 1 that generates the simplest cubic field L_m, together with the conductor f_m and the index condition m^2 + 3m + 9 = f_m (or 3 f_m or 27 f_m).

If this is right

The set of simplest cubic fields with index 1 and class number at most 1000 is finite and consists of precisely 581 members.
The same finiteness holds for the index-3 and index-27 subfamilies, with 80 and 142 members respectively.
All simplest cubic fields with parameter m up to 10 million and class number below 16 are accounted for by the given distribution of small class numbers.
Explicit lists of the 138 fields with h_m < 16 can be extracted directly from the computation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The explicit small-class-number examples could serve as test cases for conjectures on the growth of class numbers in cubic fields.
Extending the search to m larger than 10 million would test whether additional fields with h_m <= 1000 appear beyond the reported range.
The same computational approach could be applied to other one-parameter families of cubic fields to obtain comparable counts.
The conductor-index relation may allow theoretical proofs that no further fields with small class number exist once m exceeds a certain threshold.

Load-bearing premise

The PARI/GP computations of class numbers and conductors are free of overflow, precision errors and omissions for every m up to the stated bounds.

What would settle it

An independent run that produces a different total number of qualifying m for any of the three index cases, or that finds an m with h_m > 1000 inside the claimed set, would falsify the counts.

read the original abstract

Let $m\in\mathbb{Z}$ be an integer and $L_m=\mathbb{Q}(\alpha)$ be the simplest cubic field with class number $h_m$ and conductor $\mathfrak{f}_m$ where $\alpha$ is a root of $f_m(X)=X^3-mX^2-(m+3)X-1$. Let $\mathcal{O}_{L_m}$ be the ring of integers of $L_m$. By using PARI/GP, we confirm that if $[\mathcal{O}_{L_m}:\mathbb{Z}[\alpha]]=1$ $($resp. $3$, $27$$)$, i.e. $m^2+3m+9=\mathfrak{f}_m$ $($resp. $3\mathfrak{f}_m$, $27\mathfrak{f}_m$$)$, then there exist exactly $581$ (resp. $80$, $142$) integers $m\geq -1$ such that $h_m\leq 1000$. We also show that if $-1\leq m\leq 10^7$, then $h_m<16$ holds for $138=26+31+11+10+36+21+3$ integers $m$. More precisely, there exist $26$ $($resp. $31$, $11$, $10$, $36$, $21$, $3$$)$ integers $m$ with $-1\leq m\leq 10^7$ such that $h_m=1$ $($resp. $3$, $4$, $7$, $9$, $12$, $13$$)$ which are given explicitly.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

A solid computational enumeration that gives new explicit counts and lists of simplest cubic fields with small class numbers, resting entirely on PARI/GP correctness.

read the letter

The main point is that the authors ran a PARI/GP search over m >= -1 for the simplest cubic fields defined by that cubic polynomial and counted the m satisfying the index conditions with h_m <= 1000. They get 581 cases where the index is 1, 80 where it is 3, and 142 where it is 27. They also list the 138 m up to 10^7 that give h_m in {1,3,4,7,9,12,13} and break those down by value. The lists are explicit, so anyone can check them directly. This extends earlier computational work to bigger bounds and supplies fresh data points that people studying cubic class numbers might actually use. The method is straightforward: solve for the conductor condition and call the class number routine. That part is clean and reproducible in principle. The soft spot is that the whole result hangs on the software output being accurate for every m in the range. The paper gives no verification against known small cases, no cross-checks with other systems, and no comment on precision or overflow for the largest discriminants. For a pure enumeration paper this is the obvious risk, even if PARI/GP is usually reliable here. No analytic claims are made, so there is no circularity or fitting issue. This is for computational number theorists or anyone who needs concrete examples of low-class-number cubic fields. The counts are narrow enough that a referee could reasonably ask for a short methods appendix on verification, but the work is honest and the data is new. I would send it to peer review.

Referee Report

1 major / 1 minor

Summary. The manuscript uses PARI/GP to enumerate integers m ≥ -1 such that the simplest cubic field L_m = Q(α) (with minimal polynomial X^3 - m X^2 - (m+3)X -1) satisfies the index condition [O_{L_m} : Z[α]] = 1 (resp. 3, 27), i.e., m^2 + 3m + 9 equals f_m (resp. 3 f_m, 27 f_m). It reports exactly 581 (resp. 80, 142) such m with class number h_m ≤ 1000, and additionally lists explicit counts and values of m ≤ 10^7 with h_m in {1, 3, 4, 7, 9, 12, 13} totaling 138 fields.

Significance. If the enumerations are complete and accurate, the paper supplies a concrete, finite catalog of simplest cubic fields with bounded class number, which can serve as a reference dataset for studying the distribution of class numbers in cubic fields and for testing conjectures on class-number growth.

major comments (1)

[Main results / computational enumeration] The central claim of exactly 581 (resp. 80, 142) qualifying m with h_m ≤ 1000 is load-bearing on the completeness of the PARI/GP search. The manuscript does not state the upper bound on m that was searched nor supply a theoretical argument (e.g., a lower bound on h_m in terms of the conductor or discriminant) showing that no further m beyond that bound can satisfy h_m ≤ 1000 while obeying the index condition.

minor comments (1)

[Abstract] The abstract states the partition 138 = 26 + 31 + 11 + 10 + 36 + 21 + 3 but does not explicitly label which summand corresponds to which value of h_m; a parenthetical mapping would improve readability.

Simulated Author's Rebuttal

1 responses · 1 unresolved

We thank the referee for the careful reading and for identifying the need for greater clarity regarding the scope of our computational results. We address the major comment below.

read point-by-point responses

Referee: [Main results / computational enumeration] The central claim of exactly 581 (resp. 80, 142) qualifying m with h_m ≤ 1000 is load-bearing on the completeness of the PARI/GP search. The manuscript does not state the upper bound on m that was searched nor supply a theoretical argument (e.g., a lower bound on h_m in terms of the conductor or discriminant) showing that no further m beyond that bound can satisfy h_m ≤ 1000 while obeying the index condition.

Authors: We agree that the upper bound on m must be stated explicitly and that the manuscript should clarify the computational nature of the enumeration. In the revised version we will report that the PARI/GP search was performed exhaustively for all integers m ≥ −1 up to m = 10^{12}. Within this range we found precisely 581 (resp. 80, 142) qualifying m satisfying the index condition and h_m ≤ 1000. We will replace the wording “there exist exactly” with “we have enumerated” to reflect that the result is conditional on the searched range. Unfortunately, no effective lower bound on the class number of cubic fields is currently available that would rigorously exclude the possibility of additional examples with m > 10^{12} and h_m ≤ 1000. We will therefore add a brief remark acknowledging this limitation while noting that the discriminant already exceeds 10^{36} for m > 10^{12} and that no further instances appeared in our search. revision: yes

standing simulated objections not resolved

We cannot supply a theoretical proof that the enumeration is complete for all m (i.e., that no m > 10^{12} satisfies the index condition with h_m ≤ 1000), because no effective lower bounds on class numbers of cubic fields are known.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper reports explicit computational counts (581/80/142) obtained by enumerating m ≥ -1 in PARI/GP under the explicit index conditions m² + 3m + 9 = f_m (or 3f_m, 27f_m) together with the bound h_m ≤ 1000, plus a finite list of m ≤ 10^7 with small h_m. No derivation, ansatz, uniqueness theorem, or fitted parameter is invoked; the results are defined solely by the correctness of the external software on the given polynomials and conductor formulas. The argument is therefore self-contained against external benchmarks and contains no load-bearing self-referential step.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on standard facts about cubic fields, discriminant formulas, and the correctness of PARI/GP class-number routines; no free parameters are fitted and no new entities are postulated.

axioms (2)

domain assumption The polynomial f_m(X) generates a cubic field whose ring of integers has index 1, 3, or 27 in Z[alpha] precisely when the stated conductor relations hold.
Invoked in the opening paragraph to partition the search into three cases.
domain assumption PARI/GP correctly computes class numbers and conductors for all m in the scanned range.
Central to the confirmation statements; no independent verification is described.

pith-pipeline@v0.9.0 · 5584 in / 1493 out tokens · 20494 ms · 2026-05-15T08:39:18.474087+00:00 · methodology

Simplest cubic fields with small class number

Core claim

What carries the argument

If this is right

Where Pith is reading between the lines

Load-bearing premise

What would settle it

discussion (0)