Enumerating finite groups without Abelian composition factors.

DOI10.1007/BF02785965zbMath1128.20306OpenAlexW1986197559MaRDI QIDQ2382236

Benjamin Klopsch

Publication date: 28 September 2007

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02785965

zbMATH Keywords

growth ratescomposition lengthsminimal numbers of generatorsnonabelian finite simple groupsenumerating finite groupsnumbers of groups of order \(n\)

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Series and lattices of subgroups (20D30) Asymptotic results on counting functions for algebraic and topological structures (11N45)

Related Items (1)

Random generation of finite and profinite groups and group enumeration.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Enumerating finite groups of given order
• On groups without Abelian composition factors
• ENUMERATING FINITE GROUPS
• Zu einem von B. H. und H. Neumann gestellten Problem
• Enumerating p -Groups. I: Inequalities
• Enumerating Non-Soluble Groups-A Conjecture of John G. Thompson
• Maximal subgroups in finite and profinite groups
• Enumerating Perfect Groups
• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• Enumerating p -Groups
• AN ENUMERATION THEOREM FOR FINITE GROUPS

This page was built for publication: Enumerating finite groups without Abelian composition factors.