Skip to main content
SpringerLink
Log in

A table of totally complex number fields of small discriminants

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1423))

Included in the following conference series:

Abstract

Using the explicit class field theory developed in [3] and tables of number fields in low degree, we construct totally complex number fields having a degree smaller than 80 and a root discriminant near from Odlyzko's bounds. For some degrees, we extend and improve the table of totally complex number fields of small discriminants given by Martinet

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Cohen: A Course in Computational Algebraic Number Theory. GTM 138, (1993) Springer-Verlag

    Google Scholar 

  2. H. Cohen and F. Diaz y Diaz: A polynomial reduction algorithm. Sém. Th. Nombres Bordeaux (Série 2) 3, (1991) 351–360

    MATH  Google Scholar 

  3. H. Cohen, F. Diaz y Diaz and M. Olivier: Computing ray class groups, conductors and discriminants. Math. Comp. To appear

    Google Scholar 

  4. M. Daberkow and M. Pohst: Computations with relative extensions of number fields with an application to the construction of Hilbert class fields. Proc. ISAAC '95, ACM Press, (1995) 68–76

    Google Scholar 

  5. C. Fieker and M. Pohst: On lattices over number fields. Algorithmic Number Theory Symposium II. Lecture Notes in Computer Science 1122 (1996) Springer-Verlag 133–139

    Google Scholar 

  6. A. Leutbecher and G. Niklash: On cliques of exceptional units and Lenstra's construction of Euclidean fields. Journées arithmétiques 1987. Lecture Notes in Math. 1380, (1989) Springer-Verlag 150–178

    Google Scholar 

  7. J. Martinet: Petits discriminants des corps de nombres. Journées arithmétiques 1980, London Math. Soc. Lecture Note Ser. 56, (1982) Cambridge Univ. Press 151–193

    Google Scholar 

  8. A. Odlyzko: Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions: a survey of recent results. Sém. Th. des Nombres Bordeaux (Série 2) 2, (1990) 119–141

    MATH  MathSciNet  Google Scholar 

  9. X. Roblot: Unités de Stark et corps de classes de Hilbert. C. R. Acad. Sci. Paris. 323 (1996) 1165–1168

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire A2X, Université Bordeaux I, 351 cours de la Libération, 33 405, Talence, France

    Henri Cohen, Francisco Diaz y Diaz & Michel Olivier

Authors
  1. Henri Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Francisco Diaz y Diaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Michel Olivier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Joe P. Buhler

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, H., Diaz y Diaz, F., Olivier, M. (1998). A table of totally complex number fields of small discriminants. In: Buhler, J.P. (eds) Algorithmic Number Theory. ANTS 1998. Lecture Notes in Computer Science, vol 1423. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054877

Download citation

  • DOI: https://doi.org/10.1007/BFb0054877

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64657-0

  • Online ISBN: 978-3-540-69113-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation