Skip to main content Accessibility help
×
Home

Computing in quotients of rings of integers

  • Claus Fieker (a1) and Tommy Hofmann (a2)

Abstract

We develop algorithms to turn quotients of rings of integers into effective Euclidean rings by giving polynomial algorithms for all fundamental ring operations. In addition, we study normal forms for modules over such rings and their behavior under certain quotients. We illustrate the power of our ideas in a new modular normal form algorithm for modules over rings of integers, vastly outperforming classical algorithms.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Computing in quotients of rings of integers
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Computing in quotients of rings of integers
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Computing in quotients of rings of integers
      Available formats
      ×

Copyright

References

Hide All
1.Ağargün, A. G. and Fletcher, C. R., ‘Euclidean rings’, Turkish J. Math. 19 (1995) no. 3, 291299.
2.Belabas, K., ‘Topics in computational algebraic number theory’, J. Théor. Nombres Bordeaux 16 (2004) no. 1, 1963.
3.Biasse, J.-F. and Fieker, C., ‘A polynomial time algorithm for computing the HNF of a module over the integers of a number field’, Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (ISSAC ’12) (ACM, New York, NY, USA, 2012) 7582.
4.Biasse, J.-F., Fieker, C. and Hofmann, T., ‘On the computation of the HNF of a module over the ring of integers of a number field’, J. Symbolic Comput., submitted.
5.Bosma, W., Cannon, J. and Playoust, C., ‘The Magma algebra system. I. The user language’, J. Symbolic Comput. 24 (1997) no. 3–4, 235265; Computational algebra and number theory (London, 1993).
6.Bosma, W. and Pohst, M., ‘Computations with finitely generated modules over Dedekind rings’, Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation (ISSAC ’91) (ACM, New York, NY, USA, 1991) 151156.
7.Cohen, H., ‘Hermite and Smith normal form algorithms over Dedekind domains’, Math. Comp. 65 (1996) no. 216, 16811699.
8.Cohen, H., Advanced topics in computational number theory, Graduate Texts in Mathematics 193 (Springer, New York, 2000).
9.Domich, P. D., Kannan, R. and Trotter, L. E. Jr, ‘Hermite normal form computation using modulo determinant arithmetic’, Math. Oper. Res. 12 (1987) no. 1, 5059.
10.Fletcher, C. R., ‘Euclidean rings’, J. Lond. Math. Soc. (2) 4 (1971) 7982.
11.Hafner, J. L. and McCurley, K. S., ‘Asymptotically fast triangularization of matrices over rings’, SIAM J. Comput. 20 (1991) no. 6, 10681083.
12.Howell, J. A., ‘Spans in the module (Z m)s’, Linear Multilinear Algebra 19 (1986) no. 1, 6777.
13.Iliopoulos, C. S., ‘Worst-case complexity bounds on algorithms for computing the canonical structure of finite abelian groups and the Hermite and Smith normal forms of an integer matrix’, SIAM J. Comput. 18 (1989) no. 4, 658669.
14.Steinitz, E., ‘Rechteckige Systeme und Moduln in algebraischen Zahlköppern. I’, Math. Ann. 71 (1911) no. 3, 328354.
15.Steinitz, E., ‘Rechteckige Systeme und Moduln in algebraischen Zahlkörpern. II’, Math. Ann. 72 (1912) no. 3, 297345.
16.Storjohann, A., ‘Algorithms for matrix canonical forms’, PhD Thesis, Department of Computer Science, Swiss Federal Institute of Technology – ETH, 2000.
17.Storjohann, A. and Mulders, T., ‘Fast algorithms for linear algebra modulo N’, Algorithms — ESA ’98 (Venice), Lecture Notes in Computer Science 1461 (Springer, Berlin, 1998) 139150.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

MSC classification

Computing in quotients of rings of integers

  • Claus Fieker (a1) and Tommy Hofmann (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed