Speeding up an algorithm to construct the Hall collection formula

DOI10.1007/BF02355864zbMath0898.20022MaRDI QIDQ1376914

Yu. G. Teterin, A. I. Skopin

Publication date: 30 June 1998

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

Burnside groupscollection formula

Mathematics Subject Classification ID

Periodic groups; locally finite groups (20F50) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) Commutator calculus (20F12)

Related Items (2)

Computational group theory in St. Petersburg ⋮ Computer-based calculations for transmetabelian groups of exponent 16, 25, and 27

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A graphic construction of the collection formula for certain types of groups

This page was built for publication: Speeding up an algorithm to construct the Hall collection formula