Collection from the left

DOI10.1016/S0747-7171(08)80085-5zbMath0705.20017MaRDI QIDQ917695

Michael Vaughan-Lee

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

normal formfast algorithmcomputational group theorycollection from the leftfinite p-groupsHavas-Nicholson algorithmpower-commutator presentation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Finite nilpotent groups, (p)-groups (20D15) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items

Some remarks on the computation of complements and normalizers in soluble groups ⋮ An effective version of the Lazard correspondence. ⋮ On complexity of multiplication in finite soluble groups. ⋮ Using the Mal'cev correspondence for collection in polycyclic groups. ⋮ DFT-based word normalization in finite supersolvable groups. ⋮ Computation of orders and cycle lengths of automorphisms of finite solvable groups ⋮ Finite \(p\)-groups ⋮ Computing in Unipotent and Reductive Algebraic Groups ⋮ Collection from the left and other strategies ⋮ Constructing faithful representations of finitely-generated torsion-free nilpotent groups ⋮ Efficient collection in infinite polycyclic groups.

Uses Software

• Cayley

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item