Skip to main content

On lattices over number fields

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

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

Included in the following conference series:

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. Bosma, W.; Pohst, M. E.; Computations with Finitely generated Modules over Dedekind Domains; Proceedings ISSAC'91 (1991), 151–156

    Google Scholar 

  2. Chalk, J. H. H.; Algebraic Lattices; C. R. Math. Rep. Acad. Sci. Canada, Vol. II (1980)

    Google Scholar 

  3. Cohen, H.; A Course in Computational Algebraic Number Theory; Graduate Texts in Math., Vol. 138, Springer-Verlag, 1993

    Google Scholar 

  4. Cohen, H.; Hermite and Smith Normal Form Algorithms over Dedekind Domains; to appear in Math. Comp.

    Google Scholar 

  5. Fieker, C.; Jurk, A.; Pohst, M. E.; On solving relative norm equations in algebraic number fields; to appear in Math. Comp.

    Google Scholar 

  6. Fincke, U.; Pohst, M. E.; Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis; Math. Comp. 44 (1985), 463–471

    Google Scholar 

  7. Fincke, U.; Ein Ellipsoidverfahren zur Lösung von Normgleichungen; Thesis, Düsseldorf 1984

    Google Scholar 

  8. Humbert, P.; Théorie de la réduction des formes quadratiques définies positives dans un corps algébrique K fini; Commentarii Mathematici Helvetici, Vol. 12 (1939–1940), 263–306

    Google Scholar 

  9. Jurk, A.; Über die Berechnung von Lösungen relativer Normgleichungen in algebraischen Zahlkörpern; Thesis, Düsseldorf 1993

    Google Scholar 

  10. KANT group; KANT V4; to appear in J. Symb. Comput.

    Google Scholar 

  11. Lenstra, A. K.; Lenstra, H. W.; Lovász, L; Factoring Polynomials with Rational Coefficients Math. Ann. 261 (1982), 515–534

    Google Scholar 

  12. O'Meara, O. T.; Introduction to Quadratic Forms; Grundlehren der Mathematischen Wissenschaften, Vol. 117, Springer-Verlag 1963

    Google Scholar 

  13. Pohst, M. E.; Zassenhaus, H.; Algorithmic Algebraic Number Theory; Cambridge Univ. Press 1989

    Google Scholar 

  14. Rogers, K.; Swinnerton-Dyer, H. P. F.; The Geometry of Numbers over Algebraic Number Fields; Trans. AMS, Vol. 88 (1958), 227–242

    Google Scholar 

  15. Tschernikow, S.N.; Lineare Ungleichungen; Hochschulbücher für Mathematik, Vol. 69, Deutscher Verlag der Wissenschaften, Berlin 1971

    Google Scholar 

  16. Weyl, H.; Theory of Reduction for Arithmetical Equivalence; Trans. AMS, Vol. 48 (1940), 126–164 and Vol. 51 (1942), 203–231

    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

Fieker, C., Pohst, M.E. (1996). On lattices over number fields. 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_48

Download citation

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

  • 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