Search arXivSearch

arXiv · 2603.18802

Simplest cubic fields with small class number

Abstract

Let $m\in\mathbb{Z}$ be an integer and $L_m=\mathbb{Q}(α)$ be the simplest cubic field with class number $h_m$ and conductor $\mathfrak{f}_m$ where $α$ 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 determine that if $[\mathcal{O}_{L_m}:\mathbb{Z}[α]]=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. All computations of the class numbers and class groups of the listed fields are certified unconditionally. Under the GRH $($Generalized Riemann Hypothesis$)$, we confirm that these are the only such integers $m$ in the range $-1\leq m\leq 10^7$. We conjecture that the $26$ integers $m$ obtained above with $h_m=1$ are the only integers $m\geq -1$ with $h_m=1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Akinari Hoshi, Hiroaki Iida. 2026-08-27. Simplest cubic fields with small class number. https://arxiv.org/abs/2603.18802

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Asymptotic density of k-almost primes

Landau's well known asymptotic formula $$N_k(x):=\ \mid\{n\leq x : Ω(n)=k\}\mid \ \sim \left( \frac{x}{\log x} \right) \frac{(\log\log x)^{k-1}}{(k - 1)!}\ \ (x \rightarrow \infty),$$ which also holds for $$π_k(x):=\ \mid\{n\leq x : ω(n)=k\}\mid,$$ is known to be fairly poor for $k > 1$, and when $k$ is allowed to tend to infinity with $x$, the study of $N_k(x)$ and $π_k(x)$ becomes very technical [1, Chapter II.6, $§$ 6.1, p.200]. I hope to show that the method described below provides not only a more accurate approach, but rather increases in its asymptotic accuracy as $k$ tends to infinity.

math.NT

Transcendence Meets Normality: Construction of Transcendentally Normal Numbers

In this work, we study real numbers $x$ for which $p(x)$ is (absolutely) normal for every non-constant integer-valued polynomial $p$. We call such numbers transcendentally normal. We prove that almost every real number is transcendentally normal and provide an explicit construction of such a number, based on Sierpinski's covering method and novel ideas involving the so-called stretch function. In the next step, we transform this construction into an algorithm that computes the digits of a t-normal number recursively in all integer bases. Moreover, we extend our covering approach to construct and compute LIL-normal numbers whose discrepancies are of the order predicted by the law of the iterated logarithm. We also take the opportunity to discuss several interesting open problems.

math.NT