Enumerating finite groups without Abelian composition factors.

DOI10.1007/BF02785965MaRDI QIDQ2382236zbMATH OpenOpenAlexFDO

Authors 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

composition lengthsenumerating finite groupsgrowth ratesminimal numbers of generatorsnonabelian finite simple groupsnumbers of groups of order \(n\)

Mathematics Subject Classification ID

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

Recommendations

• Enumerating finite groups of given order
• Enumerating finite groups and their defining relations
• scientific article; zbMATH DE number 2151355
• ENUMERATING FINITE GROUPS
• scientific article; zbMATH DE number 5272192

Cites work

• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• AN ENUMERATION THEOREM FOR FINITE GROUPS
• Enumerating p -Groups
• Enumerating p -Groups. I: Inequalities
• ENUMERATING FINITE GROUPS
• Enumerating finite groups of given order
• Enumerating Non-Soluble Groups-A Conjecture of John G. Thompson
• Enumerating Perfect Groups
• scientific article; zbMATH DE number 3743517 (Why is no real title available?)
• scientific article; zbMATH DE number 3758564 (Why is no real title available?)
• scientific article; zbMATH DE number 1195532 (Why is no real title available?)
• Maximal subgroups in finite and profinite groups
• On groups without Abelian composition factors
• Zu einem von B. H. und H. Neumann gestellten Problem

Cited in

(1)

• Random generation of finite and profinite groups and group enumeration.

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

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