Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-10T23:15:46.854Z Has data issue: false hasContentIssue false
  • English
  • Français

Algorithmic Questions in rings of rational matriecs

Part of: Rings and algebras arising under various constructions

Published online by Cambridge University Press:  09 April 2009

Charles C. Sims
Charles C. Sims
Affiliation:
Mathematics Department Rutgers UniversityNew Brunswick NJ 08903USA e-mail: sims@math.rutgers.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

This paper discusses several algorithmic problems related to rings of rational matrices. It provides solutions to these problems in the commutative case and points out some of the difficulties to be overcome in the general case. A connection with attempts to construct Gröbner bases for ideals in free rings is also illustrated.

Keywords

rings of matricesfree ringsnoncommutative Gröbner basesalgorithms

MSC classification

Secondary: 16S50: Endomorphism rings; matrix rings 16S36: Ordinary and skew polynomial rings and semigroup rings
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 67 , Issue 3 , December 1999 , pp. 380 - 398
Copyright
Copyright © Australian Mathematical Society 1999

References

[1]Babai, L., Beals, R. and Rockmore, D., ‘Deciding finiteness of matrix groups in deterministic polynomial time’, in: Proceedings of ISSAC 93 (ACM, New York, 1993) pp. 117–126.CrossRefGoogle Scholar
[2]Becker, T. and Weispfenning, V., Gröbner bases (Springer, New York, 1993).CrossRefGoogle Scholar
[3]Dickson, L. E., Algebras and their arithmetics (University of Chicago Press, Chicago, 1923).Google Scholar
[4]Green, E., Mora, T. and Ufnarovski, V., ‘The non-commutative Gröbner freaks’, in: Symbolic rewriting techniques (Ascona 1995), Progr. Comput. Sci. Appl. Logic 15 (Birkhäuser, Basel, 1998) pp. 93–104.Google Scholar
[5]Mihailova, K. A., ‘The occurrence problem for direct products of groups’, Dokl. Akad. Nauk SSSR 119 (1958), 1103–1105, in Russian.Google Scholar
[6]Mikhalev, A. and Zolotykh, A., ‘Standard Grobner-Shirshov bases of free algebras over rings, I. Free associative algebras’, Internat. J. Algebra Comput. 8 (1998), 689–726.CrossRefGoogle Scholar
[7]Mora, T., ‘Groebner bases in noncommutative algebras’, in: Symbolic and algebraic computation (Rome, 1998), Lecture Notes in Comput. Sci. 358 (Springer, Berlin, 1989) pp. 150–161.Google Scholar
[8]Mora, T., ‘An introduction to commutative and noncommutative Gröbner bases’, in: Second International Colloquium on Words, Languages, and Combinatorics (Kyoto, 1992), Theoret. Comput.Sci. 134 (Elsevier, Amsterdam, 1994) pp. 131–173.Google Scholar
[9]Sims, C. C., Computation with finitely presented groups (Cambridge University Press, Cambridge, 1994).CrossRefGoogle Scholar
[10]Wehrfritz, B. A. F., Infinite linear groups (Springer, New York, 1973).CrossRefGoogle Scholar