Enumeration of totally real number fields of bounded root discriminant

Authors:
John Voight
Affiliations:
Department of Mathematics and Statistics, University of Vermont, Burlington, VT
Venue:
ANTS-VIII'08 Proceedings of the 8th international conference on Algorithmic number theory
Year:
2008

Citing 8
Cited 1

Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
A fast algorithm to compute cubic fields

Mathematics of Computation
Algorithm 795: PHCpack: a general-purpose solver for polynomial systems by homotopy continuation

ACM Transactions on Mathematical Software (TOMS)
Tamely ramified towers and discriminant bounds for number fields ---II

Journal of Symbolic Computation
A Table of Totally Complex Number Fields of Small Discriminants

ANTS-III Proceedings of the Third International Symposium on Algorithmic Number Theory
Gauss Composition and Generalizations

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Constructing complete tables of quartic fields using Kummer theory

Mathematics of Computation
The totally real primitive number fields of discriminant at most 109

ANTS'06 Proceedings of the 7th international conference on Algorithmic Number Theory

Algorithmic Enumeration of Ideal Classes for Quaternion Orders

SIAM Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We enumerate all totally real number fields F with rootdiscriminant δF ≤ 14. There are 1229 such fields, each with degree[F : Q] ≤ 9.