Skip to main content

Computational aspects of Kummer theory

  • 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:

  • 2589 Accesses

Abstract

New methods and algorithms for computations with pure relative extensions of algebraic number fields are discussed. The emphasis is on relative normal forms, relative bases, Hilbert class fields, subfield detection, and embedding of subfields.

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. E. Artin, Questions de base minimale dans la théorie des nombres algébriques, The collected papers of Emil Artin, Addison-Wesley 1965, 229–231.

    Google Scholar 

  2. W. Bosma and M. Pohst, Computations with finitely generated modules over Dedekind rings, Proc. ISSAC'91 (1991), 151–156.

    Google Scholar 

  3. H. Cohen, Algorithms for modules over Dedekind domains and relative extensions of number fields, to appear in Math. Comp.

    Google Scholar 

  4. M. Daberkow, Über die Bestimmung der ganzen Elemente in Radikalerweiterungen algebraischer Zahlkörper, Thesis, Berlin 1995.

    Google Scholar 

  5. M. Daberkow and M. Pohst, On Integral Bases in Relative Quadratic Extensions, to appear in Math. Comp.

    Google Scholar 

  6. M. Daberkow and M. Pohst, Computations with relative extensions of number fields with an application to the construction of Hilbert class fields, Proc. ISSAC'95, ACM Press, New York 1995, pp. 68–76.

    Google Scholar 

  7. M. Daberkow and M. Pohst, On Computing Hilbert Class Fields of Prime Degree, this volume.

    Google Scholar 

  8. M. Daberkow and M. Pohst, On the computation of Hilbert class fields, submitted for publication.

    Google Scholar 

  9. J. Dixon, Computing Subfields in Algebraic Number Fields, J. Austral. Math. Soc. (Series A) 49 (1990), 434–448.

    Google Scholar 

  10. H. Hasse, Über den Klassenkörper zum quadratischen Zahlkörper mit der Diskriminante-47, Acta Arithmetica 9 (1964), 419–434.

    Google Scholar 

  11. E. Hecke, Lectures on the Theory of Algebraic Numbers, Springer Verlag 1981.

    Google Scholar 

  12. Kant group, KANT V4, to appear in J. Symb. Comp.

    Google Scholar 

  13. J. Klüners, Über die Berechnung von Teilkörpern algebraischer Zahlkörper, Diplomarbeit, TU-Berlin 1995.

    Google Scholar 

  14. J. Klüners and M. Pohst, On Computing subfields, to appear in J. Symb. Comp.

    Google Scholar 

  15. S. Lang, Algebraic number theory, Grad. Texts in Math. 110, Springer Verlag 1986.

    Google Scholar 

  16. O. T. O'Meara, Introduction to Quadratic Forms, Springer Verlag 1963.

    Google Scholar 

  17. M. Pohst and H. Zassenhaus, Algorithmic Algebraic Number Theory, Cambridge University Press 1989.

    Google Scholar 

  18. J. Sommer, Einführung in Zahlentheorie, Teubner Verlag, Leipzig 1907.

    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

Pohst, M.E. (1996). Computational aspects of Kummer theory. 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_61

Download citation

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

  • 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