APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II

DOI10.1142/S0218196796000337zbMath0867.20003OpenAlexW4230058526MaRDI QIDQ4335881

E. A. O'Brien, M. F. Newman

Publication date: 5 June 1997

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196796000337

zbMATH Keywords

algorithmsautomorphismsrestricted Burnside groupspower-conjugate presentationsenforcing exponent lawslaws in \(p\)-groups

Mathematics Subject Classification ID

Periodic groups; locally finite groups (20F50) 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) Derived series, central series, and generalizations for groups (20F14) Commutator calculus (20F12) Engel conditions (20F45)

Related Items (22)

Invariants for metabelian groups of prime power exponent, colorings, and stairs ⋮ THE 2-GENERATOR RESTRICTED BURNSIDE GROUP OF EXPONENT 7 ⋮ Groups and nilpotent Lie rings whose order is the sixth power of a prime. ⋮ Groups with exponent six ⋮ CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS ⋮ A classification of some unsoluble varieties of groups of exponent four ⋮ The construction of finite solvable groups revisited. ⋮ Groups of prime-power order with a small second derived quotient. ⋮ Filters compatible with isomorphism testing ⋮ Universal covers of finite groups ⋮ Unnamed Item ⋮ Computing automorphism groups and testing isomorphisms for modular group algebras. ⋮ Some Lie rings associated with Burnside groups ⋮ Finite 3-groups of class 3 whose elements commute with their automorphic images. ⋮ Automorphic forms and rational homology 3-spheres ⋮ Some 3-Generator, 3-Relation Finite 2-Groups ⋮ Free Quotients of Finitely Presented Groups ⋮ A note on the existence of noninner automorphisms of order p in some finite p-groups ⋮ COMPUTING NILPOTENT QUOTIENTS OF ASSOCIATIVE ALGEBRAS AND ALGEBRAS SATISFYING A POLYNOMIAL IDENTITY ⋮ Computing with Abelian sections of finitely presented groups ⋮ Not every 𝑝-group can be generated by elements of the same order ⋮ The groups with order \(p^7\) for odd prime \(p\).

Uses Software

• QUOTPIC
• Unnamed Item

This page was built for publication: APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II