# of Karim Belabas, Aïssa Derhem, and Daniel C. Mayer

 * On these pages, we present most recent results of our joint research, directly from the lab. * Basic bibliography: K. Belabas, A fast algorithm to compute cubic fields, Math. Comp. 66 (1997), 1213-1237 A. Derhem, Capitulation dans les extensions quadratiques de corps de nombres cubiques cycliques, Thèse de doctorat, Université Laval, Québec, 1988 D. C. Mayer, Multiplicities of dihedral discriminants, Math. Comp. 58 (1992), 831-847 and S55-S58 * E-mail addresses: Karim.Belabas@math.u-psud.fr aderhem@yahoo.fr danielmayer@algebra.at *

Families of pure cubic fields (2002/03/18)
Dan (02/03/18):
Now I have ordered the 827600 pure cubic fields L = Q(R^1/3)
with normalized radicands R = a*b^2 < 10^6
by increasing conductors f = [3*]a*b < 3*10^6.

This database is more than 100 times bigger than the previously mentioned
excerpt containing the 7811 pure cubics with conductors f < 10^4.
Filtering out this excerpt was by no means random but had a very precise reason:

I have a general theorem warranting that, for any upper bound B,
an excerpt of the pure cubic fields with conductors f < B^{2/3}
from a table of all pure cubic fields with radicands R < B
consists of Complete Families.
And taking B = 10^6 obviously yields B^{2/3} = 10^4.

Without filtering this excerpt, however,
an overwhelming part of the families is incomplete.
It is illuminating to separate the occuring
formal families of fields (L_i)_{1 <= i <= n}
with various formal multiplicities n <= 16
into complete and incomplete families,
corresponding to diagonal (boldface) and subdiagonal entries
in the following lower triangular matrix:
 n=1 n=2 n=3 n=4 n=5 n=6 n=7 n=8 n=9 n=10 n=11 n=12 n=13 n=14 n=15 n=16 m=1 219834 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m=2 172439 26902 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m=3 51156 11435 2743 0 0 0 0 0 0 0 0 0 0 0 0 0 m=4 61536 18654 5398 4672 0 0 0 0 0 0 0 0 0 0 0 0 m=5 11075 2163 501 237 116 0 0 0 0 0 0 0 0 0 0 0 m=6 14683 3953 640 274 105 92 0 0 0 0 0 0 0 0 0 0 m=8 28277 8135 5436 2732 1094 452 426 515 0 0 0 0 0 0 0 0 m=10 1501 224 45 18 12 7 0 2 0 0 0 0 0 0 0 0 m=11 1107 302 35 27 12 4 3 2 1 0 1 0 0 0 0 0 m=12 700 190 15 10 2 2 0 0 1 0 0 0 0 0 0 0 m=16 7817 2097 1614 456 442 193 120 82 52 34 31 14 21 7 8 28 m=20 13 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m=21 18 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m=22 43 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m=24 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m=32 744 185 119 21 22 15 7 4 1 2 1 1 2 0 0 1 m=64 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

Obviously there are cumulations of families
at 2-power multiplicities m = 4,8,16,32,
which remind me of nuclear islands of stability (magic numbers of nucleons).
Dan (02/03/18):
Nevertheless, we now have much more Complete Multiplets, too:

219834 instead of 2945 Complete Singulets (m = 1)
26902 instead of 1164 Complete Doublets (m = 2)
2743 instead of 231 Complete Triplets (m = 3)
4672 instead of 264 Complete Quadruplets (m = 4)
116 instead of 13 Complete Quintuplets (m = 5)
92 instead of 10 Complete Sextuplets (m = 6)
515 instead of 79 Complete Octuplets (m = 8)
1 instead of 0 Complete Hendecuplets (m = 11)
28 instead of 2 Complete Hexadecuplets (m = 16)

True multiplicities m = 10,12,20,21,22,24,32,64 occur only for incomplete families,
m = 40,42,43,44,... will occur in higher ranges of conductors f, and
m = 7,9,13,14,15,17,18,19,23,25,26,27,28,29,30,31,33,34,35,36,37,38,39,41,...
are impossible for theoretical reasons.

See D. C. Mayer, Multiplicities of dihedral discriminants,
Math. Comp. 58 (1992), 831-847 and S55-S58