Dependency of units in number fields
HTML articles powered by AMS MathViewer
- by Claus Fieker and Michael E. Pohst PDF
- Math. Comp. 75 (2006), 1507-1518 Request permission
Abstract:
We develop a method for validating the indepencence of units in algebraic number fields. In case that a given system of units has a dependency, we compute a certificate for this.References
- Karim Belabas, Topics in computational algebraic number theory, J. Théor. Nombres Bordeaux 16 (2004), no. 1, 19–63 (English, with English and French summaries). MR 2145572
- John J. Cannon, MAGMA, http://magma.maths.usyd.edu.au, 2003.
- Henri Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics, vol. 138, Springer-Verlag, Berlin, 1993. MR 1228206, DOI 10.1007/978-3-662-02945-9
- Edward Dobrowolski, On the maximal modulus of conjugates of an algebraic integer, Bull. Acad. Polon. Sci. Sér. Sci. Math. Astronom. Phys. 26 (1978), no. 4, 291–292 (English, with Russian summary). MR 491585
- Nicholas J. Higham, Analysis of the Cholesky decomposition of a semi-definite matrix, Reliable numerical computation, Oxford Sci. Publ., Oxford Univ. Press, New York, 1990, pp. 161–185. MR 1098323
- L. Kronecker, Zwei Sätze über Gleichungen mit ganzahlingen Coeffizienten, J. Reine Angew. Math 53 (1857), 173–175.
- Władysław Narkiewicz, Elementary and analytic theory of algebraic numbers, 3rd ed., Springer Monographs in Mathematics, Springer-Verlag, Berlin, 2004. MR 2078267, DOI 10.1007/978-3-662-07001-7
- M. Pohst, A modification of the LLL reduction algorithm, J. Symbolic Comput. 4 (1987), no. 1, 123–127. MR 908420, DOI 10.1016/S0747-7171(87)80061-5
- M. Pohst, A modification of the LLL reduction algorithm, J. Symbolic Comput. 4 (1987), no. 1, 123–127. MR 908420, DOI 10.1016/S0747-7171(87)80061-5
- Michael E. Pohst, Computational algebraic number theory, DMV Seminar, vol. 21, Birkhäuser Verlag, Basel, 1993. MR 1243639, DOI 10.1007/978-3-0348-8589-8
- M. Pohst and H. Zassenhaus, Algorithmic algebraic number theory, Encyclopedia of Mathematics and its Applications, vol. 30, Cambridge University Press, Cambridge, 1989. MR 1033013, DOI 10.1017/CBO9780511661952
- A. Schinzel and H. Zassenhaus, A refinement of two theorems of Kronecker, Michigan Math. J. 12 (1965), 81–85. MR 175882
- J. Stoer and R. Bulirsch, Introduction to numerical analysis, 3rd ed., Texts in Applied Mathematics, vol. 12, Springer-Verlag, New York, 2002. Translated from the German by R. Bartels, W. Gautschi and C. Witzgall. MR 1923481, DOI 10.1007/978-0-387-21738-3
Additional Information
- Claus Fieker
- Affiliation: School of Mathematics and Statistics, University of Sydney, NSW 2006, Australia.
- Email: claus@maths.usyd.edu.au
- Michael E. Pohst
- Affiliation: Institut für Mathematik, Technische Universität Berlin, Straße des 17. Juni 136, 10623 Berlin, Germany.
- Email: pohst@math.TU-Berlin.DE
- Received by editor(s): July 21, 2004
- Published electronically: April 3, 2006
- Additional Notes: This article was written while the second author visited the Computational Algebra Group at the University of Sydney in October, 2003.
- © Copyright 2006 American Mathematical Society
- Journal: Math. Comp. 75 (2006), 1507-1518
- MSC (2000): Primary 11Y16, 11-04
- DOI: https://doi.org/10.1090/S0025-5718-06-01899-0
- MathSciNet review: 2219041