Existence, algorithms, and asymptotics of direct product decompositions, I
Open Access
- 1 January 2012
- journal article
- research article
- Published by Walter de Gruyter GmbH in Groups - Complexity - Cryptology
- Vol. 4 (1) , 33-72
Abstract
A polynomial-time algorithm is produced which, given generators for a group of permutations on a finite set, returns a direct product decomposition of the group into directly indecomposable subgroups. The process uses bilinear maps and commutative rings to characterize direct products of p-groups of class 2 and reduces general groups to p-groups using group varieties. The methods apply to quotients of permutation groups and operator groups as well.Comment: 39 pages, 6 figureKeywords
All Related Versions
This publication has 3 references indexed in Scilit:
- Division, Adjoints, and Dualities of Bilinear MapsCommunications in Algebra, 2013
- Decomposing p-groups via Jordan algebrasJournal of Algebra, 2009
- Finding central decompositions of p-groupsJournal of Group Theory, 2009