Finding central decompositions of p-groups

Abstract

Polynomial-time algorithms are given to find a central decomposition of maximum size for a finite p-group of class 2 and for a nilpotent Lie ring of class 2. The algorithms use Las Vegas probabilistic routines to compute the structure of finite *-rings and also the Las Vegas C-MeatAxe. When p is small, the probabilistic methods can be replaced by deterministic polynomial-time algorithms. The methods introduce new group isomorphism invariants including new characteristic subgroups.

28 pages

Cited by in corpus (7)

• Isomorphism in expanding families of indistinguishable groups
• A fast isomorphism test for groups of genus 2
• Finding direct product decompositions in polynomial time
• Optimal algorithms of Gram-Schmidt type
• Division, adjoints, and dualities of bilinear maps
• Group-theoretic generalisations of vertex and edge connectivities
• From independent sets and vertex colorings to isotropic spaces and isotropic decompositions