Treating the exceptional cases of the meatAxe

Experimental Mathematics

Volumn 9, Issue 3, 2000, Pages 373-381

  Ivanyos, Gabor ^a   Lux, Klaus ^b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b The University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034347996     PISSN: 10586458     EISSN: 1944950X     Source Type: Journal    
DOI: 10.1080/10586458.2000.10504414     Document Type: Article

References (11)

1. D. Bini and V. Y. Pan, Polynomial and matrix computations, v. 1: Fundamental algorithms, Birkhäuser, Boston, 1994.
2. W. Eberly and M. Giesbrecht, “Efficient decomposition of associative algebras”, pp. 170-178 in ISSAC’96: Proceedings of the International Symposium on Symbolic and Algebraic Computation (Zurich, 1996), edited by Y. N. Lakshman, ACM Press, New York, 1996.
3. M. Giesbrecht, “Nearly optimal algorithms for canonical matrix forms”, SIAM J. Comput. 24:5 (1995), 948-969.
4. D. F. Holt and S. Rees, “Testing modules for irreducibility”, J. Austral. Math. Soc. Ser. A 57:1 (1994), 1-16.
5. K. Lux, Algorithmic methods in modular representation theory, Habilitationschrift, Rheinisch- Westfalische Technische Hochschule, Aachen, Germany, 1997.
6. A. Malcev, “On the representation of an algebra as a direct sum of the radical and a semisimple subalgebra”, Doklady Acad. Sci. URSS (N.S.) 36 (1942), 42-45.
7. R. A. Parker, “The computer calculation of modular characters (the Meat-Axe)”, pp. 267-274 in Computational group theory (Durham, 1982), edited by M. D. Atkinson, Academic Press, London, 1984.
8. R. S. Pierce, Associative algebras, Graduate Texts in Math. 88, Springer, New York, 1982.
9. I. Reiner, Maximal orders, London Mathematical Society Monographs 5, Academic Press, London and New York, 1975.
10. L. Rónyai, “Computations in associative algebras”, pp. 221-243 in Groups and computation (New Brunswick, 1991), edited by L. Finkelstein and W. M. Kantor, DIMACS Ser. Discrete Math. Theoret. Comp. Sci. 11, Amer. Math. Soc., Providence, 1993.
11. M. Schönert et al., GAP: Groups, algorithms, and programming, 5th ed., Lehrstuhl D fur Mathematik, RWTH Aachen, 1996. See http://www.math.rwth-aachen.de/-GAP/WWW/.