Skip to main content

Computing ray class groups, conductors and discriminants

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

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

Included in the following conference series:

Abstract

We describe the computation of ray class groups of number fields, conductors and discriminants of the corresponding Abelian extensions. As an application we give several number fields with discriminants less than previously known ones.

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

Access this chapter

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, Springer-Verlag, Berlin, Heidelberg, New York (1993).

    Google Scholar 

  2. H. Cohen, F. Diaz y Diaz and M. Olivier: Computing ray class groups, conductors and discriminants, preprint (1996).

    Google Scholar 

  3. 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 (1995), to appear.

    Google Scholar 

  4. A. Leutbecher: Euclidean fields having a large Lenstra constant, Ann. Inst. Fourier 35, 2 (1985) 83–106.

    Google Scholar 

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

    Google Scholar 

  6. J. Martinet: Petits discriminants des corps de nombres, Journées arithmétiques 1980 (J.V. Armitage, Ed.), London Math. Soc. Lecture Notes Ser. 56 (1982), 151–193.

    Google Scholar 

  7. A. M. 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.

    Google Scholar 

  8. M. Pohst and H. Zassenhaus: Algorithmic algebraic number theory, Encyclopedia of Math. and its Applications, Cambridge University Press, Cambridge (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Henri Cohen

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cohen, H., y Diaz, F.D., Olivier, M. (1996). Computing ray class groups, conductors and discriminants. In: Cohen, H. (eds) Algorithmic Number Theory. ANTS 1996. Lecture Notes in Computer Science, vol 1122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61581-4_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-61581-4_40

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61581-1

  • Online ISBN: 978-3-540-70632-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics