Speeding up an algorithm to construct the Hall collection formula

DOI10.1007/BF02355864zbMATH Open0898.20022MaRDI QIDQ1376914FDOQ1376914

Authors: A. I. Skopin, Yu. G. Teterin 

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

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

Cites Work

• Title not available (Why is that?)
• Bases of free metabelian and transmetabelian groups
• A graphic construction of the collection formula for certain types of groups
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1376914)