Finding direct product decompositions in polynomial time

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.

39 pages, 6 figures

References in corpus (1)

• Finding central decompositions of p-groups

Cited by in corpus (11)

• A fast isomorphism test for groups of genus 2
• The threshold for subgroup profiles to agree is $\Omega (\log n)$
• Skolem-Noether for nilpotent products
• Longer nilpotent series for classical unipotent subgroups
• On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract)
• Disjoint direct product decomposition of permutation groups
• Enumerating alternating matrix spaces over finite fields with explicit coordinates
• On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
• Smooth cuboids in group theory
• Enumerating isoclinism classes of semi-extraspecial groups
• Tensor products of coherent configurations