Not every 𝑝-group can be generated by elements of the same order

DOI10.1090/S0002-9939-06-08576-5zbMath1111.20021OpenAlexW1553709490MaRDI QIDQ3419927

Carlo Maria Scoppola, E. A. O'Brien, Michael Vaughan-Lee

Publication date: 1 February 2007

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9939-06-08576-5

zbMATH Keywords

finite \(p\)-groupsindecomposable groupsgroups generated by elements of the same ordernon-GSO-groups

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Finite nilpotent groups, (p)-groups (20D15)

Cites Work

• Powerful \(p\)-groups. I: Finite groups.
• Endomorphisms of two-generated metabelian groups that induce the identity modulo the derived subgroup
• The \(p\)-group generation algorithm
• APPLICATION OF COMPUTERS TO QUESTIONS LIKE THOSE OF BURNSIDE, II
• Unnamed Item
• Unnamed Item

This page was built for publication: Not every 𝑝-group can be generated by elements of the same order