APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II

DOI10.1142/S0218196796000337MaRDI QIDQ4335881zbMATH OpenOpenAlexFDO

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

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

algorithmsautomorphismsenforcing exponent lawslaws in \(p\)-groupspower-conjugate presentationsrestricted Burnside groups

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Finite nilpotent groups, (p)-groups (20D15) Generators, relations, and presentations of groups (20F05) Commutator calculus (20F12) Derived series, central series, and generalizations for groups (20F14) Engel conditions (20F45) Periodic groups; locally finite groups (20F50)

Review text

We show how automorphisms can be used to reduce significantly the resources needed to enforce laws in \(p\)-groups. This increases the extent to which Burnside groups with prime-power exponent can be studied in detail. For example, we describe how to construct power-conjugate presentations for the restricted Burnside groups \(R(5,4)\) and \(R(3,5)\) which have orders \(2^{2728}\) and \(5^{2282}\) respectively. We also describe how to determine the exponent of a \(p\)-group and report on relevant features of the current implementation of an algorithm to compute power-conjugate presentations. [For Part I, cf. \textit{G. Havas} and \textit{M. F. Newman}, Lect. Notes Math. 806, 211-230 (1980; Zbl 0432.20033).]

Recommendations

• THE 2-GENERATOR RESTRICTED BURNSIDE GROUP OF EXPONENT 7
• The \(p\)-group generation algorithm
• scientific article; zbMATH DE number 1254013

Cited in

(27)

• Computing with Abelian sections of finitely presented groups
• A classification of some unsoluble varieties of groups of exponent four
• Groups of prime-power order with a small second derived quotient.
• Groups and nilpotent Lie rings whose order is the sixth power of a prime.
• Filters compatible with isomorphism testing
• Universal covers of finite groups
• Automorphic forms and rational homology 3-spheres
• The groups with order p^7 for odd prime p.
• COMPUTING NILPOTENT QUOTIENTS OF ASSOCIATIVE ALGEBRAS AND ALGEBRAS SATISFYING A POLYNOMIAL IDENTITY
• Acceleration of an algorithm to construct Ph. Hall's collection formula
• Not every 𝑝-group can be generated by elements of the same order
• Some 3-Generator, 3-Relation Finite 2-Groups
• The construction of finite solvable groups revisited.
• scientific article; zbMATH DE number 1254013 (Why is no real title available?)
• Groups with exponent six
• Some Lie rings associated with Burnside groups
• CONSTRUCTING AUTOMORPHISM GROUPS OF p-GROUPS
• Free Quotients of Finitely Presented Groups
• THE 2-GENERATOR RESTRICTED BURNSIDE GROUP OF EXPONENT 7
• A note on the existence of noninner automorphisms of order \(p\) in some finite \(p\)-groups
• Invariants for metabelian groups of prime power exponent, colorings, and stairs
• Left \(3\)-Engel elements in groups: a survey
• Computational group theory. Abstracts from the workshop held June 1--6, 2025
• Computational group theory: bedrock and new frontiers
• Finite 3-groups of class 3 whose elements commute with their automorphic images.
• Arithmetic in group extensions
• Computing automorphism groups and testing isomorphisms for modular group algebras.

Describes a project that uses

Uses Software

• QUOTPIC
• Cayley

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

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