Abstract
We enumerate all totally real number fields F with root discriminant δ F ≤ 14. There are 1229 such fields, each with degree .
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aguirre, J., Bilbao, M., Peral, J.C.: The trace of totally positive algebraic integers. Math. Comp. 75(253), 385–393 (2006)
Belabas, K.: A fast algorithm to compute cubic fields. Math. Comp. 66(219), 1213–1237 (1997)
Bhargava, M.: Gauss composition and generalizations. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 1–8. Springer, Heidelberg (2002)
Cohen, H.: Advanced Topics in Computational Number Theory. In: Graduate Texts in Mathematics, vol. 193, Springer, New York (2000)
Cohen, H., Diaz y Diaz, F.: A polynomial reduction algorithm. Sém. Théor. Nombres Bordeaux 3(2), 351–360 (1991)
Cohen, H., Diaz y Diaz, F., Olivier, M.: A table of totally complex number fields of small discriminants. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 381–391. Springer, Heidelberg (1998)
Cohen, H., Diaz y Diaz, F., Olivier, M.: Constructing complete tables of quartic fields using Kummer theory. Math. Comp. 72(242), 941–951 (2003)
Cohn, H., Elkies, N.: New upper bounds on sphere packings I. Ann. Math. 157, 689–714 (2003)
Conway, J.H.,, Sloane, N.J.A.: Sphere packings, lattices and groups. In: Grund. der Math. Wissenschaften, 3rd edn., vol. 290, Springer, New York (1999)
De Loera, J., Hemmecke, R., Tauzer, J., Yoshia, R.: Effective lattice point counting in rational convex polytopes. J. Symbolic Comput. 38(4), 1273–1302 (2004)
De Loera, J.: LattE: Lattice point Enumeration (2007), http://www.math.ucdavis.edu/~latte/
Ellenberg, J.S., Venkatesh, A.: The number of extensions of a number field with fixed degree and bounded discriminant. Ann. of Math. 163(2), 723–741 (2006)
Fincke, U., Pohst, M.: Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math. Comp. 44, 170, 463–471 (1985)
Hajir, F., Maire, C.: Tamely ramified towers and discriminant bounds for number fields. Compositio Math. 128, 35–53 (2001)
Hajir, F., Maire, C.: Tamely ramified towers and discriminant bounds for number fields. II. J. Symbolic Comput. 33, 415–423 (2002)
Number field tables, ftp://megrez.math.u-bordeaux.fr/pub/numberfields/
Klüners, J., Malle, G.: A database for number fields, http://www.math.uni-duesseldorf.de/~klueners/minimum/minimum.html
Klüners, J., Malle, G.: A database for field extensions of the rationals. LMS J. Comput. Math. 4, 82–196 (2001)
Kreuzer, M., Skarke, H.: PALP: A Package for Analyzing Lattice Polytopes (2006), http://hep.itp.tuwien.ac.at/~kreuzer/CY/CYpalp.html
Lenstra, A.K., Lenstra, H.W., Lovász, L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515–534 (1982)
Long, D.D., Maclachlan, C., Reid, A.W.: Arithmetic Fuchsian groups of genus zero. Pure Appl. Math. Q. 2, 569–599 (2006)
Malle, G.: The totally real primitive number fields of discriminant at most 109. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 114–123. Springer, Heidelberg (2006)
Martin, J.: Improved bounds for discriminants of number fields (submitted)
Martinet, J.: Petits discriminants des corps de nombres. In: Journées Arithmétiques (Exeter, 1980). London Math. Soc. Lecture Note Ser., vol. 56, pp. 151–193. Cambridge Univ. Press, Cambridge (1982)
Martinet, J.: Tours de corps de classes et estimations de discriminants. Invent. Math. 44, 65–73 (1978)
Martinet, J.: Methodes geométriques dans la recherche des petitis discriminants. In: Sem. Théor. des Nombres (Paris 1983–84), pp. 147–179. Birkhäuser, Boston (1985)
Odlyzko, A.M.: Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions: a survey of recent results. Sém. Théor. Nombres Bordeaux 2(2), 119–141 (1990)
The PARI Group: PARI/GP (version 2.3.2), Bordeaux (2006), http://pari.math.u-bordeaux.fr/ .
Pohst, M.: On the computation of number fields of small discriminants including the minimum discriminants of sixth degree fields. J. Number Theory 14, 99–117 (1982)
Roblot, X.-F.: Totally real fields with small root discriminant, http://math.univ-lyon1.fr/~roblot/tables.html .
Stein, W.: SAGE Mathematics Software (version 2.8.12). The SAGE Group (2007), http://www.sagemath.org/
Smyth, C.J.: The mean values of totally real algebraic integers. Math. Comp. 42, 663–681 (1984)
Takeuchi, K.: Totally real algebraic number fields of degree 9 with small discriminant. Saitama Math. J. 17, 63–85 (1999)
Verschelde, J.: Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Transactions on Mathematical Software 25, 251–276 (1999)
Voight, J.: Totally real number fields, http://www.cems.uvm.edu/~voight/nf-tables/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Voight, J. (2008). Enumeration of Totally Real Number Fields of Bounded Root Discriminant. In: van der Poorten, A.J., Stein, A. (eds) Algorithmic Number Theory. ANTS 2008. Lecture Notes in Computer Science, vol 5011. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79456-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-79456-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79455-4
Online ISBN: 978-3-540-79456-1
eBook Packages: Computer ScienceComputer Science (R0)