Groups with exponent six
The study of groups with exponent six is a special case of the study of the Burnside questions about periodic groups. The nature of relations required to provide proofs of finiteness for some groups with exponent six is investigated. Let \(C(r,s)\) be the largest 2-generator group with exponent six generated by elements of orders \(r\) and \(s\). Presentations for the groups \(C(2,2)\), \(C(2,3)\), \(C(3,3)\), \(C(2,6)\) and \(C(3,6)\) are determined. Upper and lower bounds for the number of sixth powers needed to define the largest 2-generator group with exponent six are obtained.
- A computer application to finite p-groups
- A finite soluble quotient algorithm
- APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
- Engel-4 Groups of Exponent 5
- scientific article; zbMATH DE number 1273662 (Why is no real title available?)
- On the p -Length of p -Soluble Groups and Reduction Theorems for Burnside's Problem
- Recognizing badly presented \(Z\)-modules
- THE FREE BURNSIDE GROUPS OF SUFFICIENTLY LARGE EXPONENTS
- The Magma algebra system. I: The user language
- The exponents of nonabelian tensor products of groups.
- Computing in groups with exponent six
- Groups of exponent 60 with prescribed orders of elements
- Semiregular elements in cubic vertex-transitive graphs and the restricted Burnside problem
- scientific article; zbMATH DE number 3873591 (Why is no real title available?)
- On groups of exponent 36.
- Groups of exponent 12 without elements of order 12.
- Groups of exponent eight
- A question of Mazurov on groups of exponent dividing 12
- On power endomorphisms of n-central groups
This page was built for publication: Groups with exponent six
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4261226)