CONSTRUCTING THE GROUP PRESERVING A SYSTEM OF FORMS
Authors:
- 1 March 2008
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in International Journal of Algebra and Computation
- Vol. 18 (02) , 227-241
Abstract
We present a practical algorithm to construct the subgroup of the general linear group that preserves a system of bilinear or sesquilinear forms on a vector space defined over a finite field. Components include efficient algorithms to construct the Jacobson radical and the group of units of a matrix algebra.Keywords
This publication has 9 references indexed in Scilit:
- Alternating forms and self-adjoint operatorsJournal of Algebra, 2007
- Permutation Group Algorithms2003
- CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPSCommunications in Algebra, 2002
- Efficient Decomposition of Associative Algebras over Finite FieldsJournal of Symbolic Computation, 2000
- Treating the Exceptional Cases of the MeatAxeExperimental Mathematics, 2000
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Testing modules for irreducibilityJournal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1994
- Computing with group homomorphismsJournal of Symbolic Computation, 1991
- Computing the order of centralizers in linear groupsInformation and Computation, 1991