2003/01/09 by Csaba Schneider, Schneider, Csaba
Computer Science · Mathematics · #20-04 #20D15 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #Rings, Modules, and Algebras #math.GR #msc:20-04 #msc:20D15
paper · pdf · doi:10.48550/arxiv.math/0301078
16 pages
arxiv created 2003/01/09 · openalex publication_date 2003/01/09 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For odd primes we prove some structure theorems for finite p-groups G, such that G''≠ 1 and |G'/G''|=p3. Building on results of Blackburn and Hall, it is shown that \lcs G3 is a maximal subgroup of G', the group G has a central decomposition into two simpler subgroups, and, moreover, G' has one of two isomorphism types.