Skip to main content
zenodoopen

Primitive quartic number fields of absolute discriminant at most 10^9

<p>Complete list of all primitive number fields of degree 4 and absolute discriminant at most 10<sup>9</sup>. Computed through a method similar to that of Belabas [1], but starting from Bhargava&#39;s bijection [2] instead of Davenport-Heilbronn&#39;s.</p> <p>File &quot;raw&quot;: the following data are given for each field:</p> <ul> <li>Coefficients of a pair (F<sub>1</sub>, F<sub>2</sub>) of ternary quadratic forms corresponding to the field under Bhargava&#39;s bijection: F<sub>1</sub> = v<sub>0</sub> x<sup>2</sup> + v<sub>1</sub> x y + v<sub>2</sub> x z + v<sub>3</sub> y<sup>2</sup> + v<sub>4</sub> y z + v<sub>5</sub> z<sup>2</sup> and F<sub>2</sub> = v<sub>6</sub> x<sup>2</sup> + v<sub>7</sub> x y + v<sub>8</sub> x z + v<sub>9</sub> y<sup>2</sup> + v<sub>10</sub> y z + v<sub>11</sub> z<sup>2</sup>.</li> <li>Cubic covariant of (F<sub>1</sub>, F<sub>2</sub>): if M<sub>1</sub>, M<sub>2</sub> are the matrices representing F<sub>1</sub>, F<sub>2</sub>, then 4 det(x M<sub>1</sub> + y M<sub>2</sub>) = p<sub>0</sub> x<sup>3</sup> + p<sub>1</sub> x<sup>2</sup> y + p<sub>2</sub> x y<sup>2</sup> + p<sub>3</sub> y<sup>3</sup>.</li> <li>Resultant of F<sub>1</sub>(x, y, 1) and F<sub>2</sub>(x, y, 1) with respect to y: r<sub>0</sub> x<sup>4</sup> + r<sub>1</sub> x<sup>3</sup> + r<sub>2</sub> x<sup>2</sup> + r<sub>3</sub> x + r<sub>4</sub>. This is a defining polynomial for the field.</li> </ul> <p>Files &quot;Ti.gp&quot;: the index i is the number of pairs of complex embeddings. The following data are given for each field:</p> <ul> <li>Discriminant.</li> <li>Coefficients of the canonical defining polynomial for the field, as given by PARI&#39;s function polredabs.</li> <li>Number of elements and cyclic decomposition of the class group, as given by PARI&#39;s function bnfinit.</li> </ul> <p>The following sanity checks have been performed:</p> <ul> <li>The number of totally real fields agrees with that computed by Malle [3] using Hunter&#39;s method.</li> <li>The list of discriminants (with multiplicities) agrees with that computed by PARI&#39;s function nflist using class field theory (conditionally on the generalised Riemann hypothesis).</li> </ul> <p>References:</p> <ol> <li>Karim Belabas. A fast algorithm to compute cubic fields. <em>Math. Comp.</em>, 66(219):1213&ndash;1237, 1997.</li> <li>Manjul Bhargava. Higher composition laws. III. The parametrization of quartic rings. <em>Ann. of Math. (2)</em>, 159(3):1329&ndash;1360, 2004.</li> <li>Gunter Malle. The totally real primitive number fields of discriminant at most 10<sup>9</sup>. In <em>Algorithmic number theory</em>, volume 4076 of <em>Lecture Notes in Comput. Sci.</em>, pages 114&ndash;123. Springer, Berlin, 2006.</li> </ol>

ShareScore

32/100

Overall dataset sharing score

Score breakdown

These five areas show where the dataset supports — or may limit — practical reuse.

Stewardship
4
Harmonization
4
Access
16
Reuse readiness
8
Engagement
0

ScienceDex for faculty

Your academic CV and NIH biosketch

Make your CV in your school's format and your NIH biosketch from it, then download both as Word files.