Computational Methods
- Werner Bley and Henri Johnston, Computing generators of free modules over orders in group algebras, J. Algebra 320 (2008), no. 2, 836–852.[MR]
- Jon F. Carlson and Graham Matthews, Generators and relations for matrix algebras, J. Algebra 300 (2006), no. 1, 134–159.[MR]
- Alexander Chistov, Gábor Ivanyos, and Marek Karpinski, Polynomial time algorithms for modules over finite dimensional algebras, in Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Kihei, HI), ACM, New York, 1997, pp. 68–74 (electronic).[MR]
- David J. Green, Gröbner bases for p-group algebras, preprint (2009).[arXiv]
- Edward L. Green, Lenwood S. Heath, and Craig A. Struble, Constructing homomorphism spaces and endomorphism rings, J. Symbolic Comput. 32 (2001), no. 1-2, 101–117.[MR/link]
- Timo Hanke, The isomorphism problem for cyclic algebras and an application, ISSAC 2007, ACM, New York, 2007, pp. 181–186.[MR/arXiv]
- Gábor Ivanyos and Klaus Lux, Treating the exceptional cases of the MeatAxe, Experiment. Math. 9 (2000), no. 3, 373–381.[MR]
- Graham Matthews, Computing Generators and Relations for Matrix Algebras, PhD Thesis, University of Georgia, 2004.
- Gabriele Nebe and Allan Steel, Recognition of division algebras, J. Algebra 322 (2009), no. 3, 903–909.[doi]
- Bernd Souvignier, Decomposing homogeneous modules of finite groups in characteristic zero, J. Algebra 322 (2009), no. 3, 948–956.
- John Voight, Identifying the matrix ring: Algorithms for quaternion algebras and quadratic forms, preprint (2010), 35 pages.[arXiv]
- Katsushi Waki, Calculation of direct summands of FG-modules, Sci. Rep. Hirosaki Univ. 44 (1997), no. 2, 193–200.[MR]