Classification of finite groups: recent developements and open problems

DOI10.1007/S10208-024-09688-1MaRDI QIDQ6880491zbMATH OpenFDO

Authors B. Eick

Publication date 19 December 2025

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10208-024-09688-1

zbMATH Keywords

classification of finite groupsconstruction algorithmsdatabases in group theorysmall groups library

Mathematics Subject Classification ID

History of group theory (20-03) Computational methods for problems pertaining to group theory (20-08) Research data for problems pertaining to group theory (20-11) Finite simple groups and their classification (20D05) Finite nilpotent groups, (p)-groups (20D15) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05)

Review text

The paper surveys the problem of classifying finite groups up to isomorphism, focusing on progress achieved over the last twenty-five years. Classification by order is recalled, emphasizing the influence of the prime-power factorization of the order and the behavior of the counting function \(f(n)\) of isomorphism types.\N\NClassical asymptotic results for \(f(n)\) are reviewed, including the theorems of Higman, Sims and Pyber, which show that the maximal exponent in the prime decomposition of \(n\) is the dominant parameter [\textit{G. Higman}, Proc. Lond. Math. Soc., III. Ser. 10, 24--30 (1960; Zbl 0093.02603); Proc. Lond. Math. Soc. (3) 10, 566--582 (1960; Zbl 0201.36502); \textit{C. C. Sims}, Proc. Lond. Math. Soc. (3) 15, 151--166 (1965; Zbl 0133.28401); \textit{L. Pyber}, Ann. Math. (2) 137, No. 1, 203--220 (1993; Zbl 0778.20012)]. These estimates explain the exceptional complexity of certain orders such as \(128\) and \(192\).\N\NThe article gives a detailed overview of algorithmic methods for constructing finite groups. In particular, the \(p\)-group generation algorithm and its descendants are described, together with Frattini extension techniques for solvable groups and modern approaches to the construction of non-solvable groups. Variants concerned with counting groups without explicit enumeration are also discussed.\N\NLarge classification projects are summarized, including groups of order up to \(2000\), groups of prime-power order and groups whose orders involve few primes. The role of computational databases such as the SmallGroups and LiePRing libraries and their implementation in GAP and Magma is explained.\N\NThe paper concludes with several open problems, notably the completion of the classification of groups of order \(1024\) and extensions to higher prime powers and mixed orders.

Cites work

• A MILLENNIUM PROJECT: CONSTRUCTING SMALL GROUPS
• Addendum to ``On the groups of cube-free order.
• Bildung zusammengesetzter Gruppen.
• Constructing groups of `small' order: recent results and open problems
• Construction of finite groups
• Counting groups: Gnus, Moas, and other exotica
• Determination of the Groups of Orders 101-161, Omitting Order 128
• Determination of the Groups of Orders 162-215 Omitting Order 192
• Die Gruppen der Ordnungen \(p^3\), \(pq^2\), \(pqr\), \(p^4\).
• Die Gruppen mit quadratfreier Ordnungszahl.
• Enumerating p -Groups
• Enumerating p -Groups, II: Problems Whose Solution is PORC
• Enumerating p -Groups. I: Inequalities
• Enumerating finite groups of given order
• Finite groups of fourth-power free order.
• Groups and nilpotent Lie rings whose order is the sixth power of a prime.
• Groups of order p^3q.
• Groups whose orders factorise into at most four primes
• scientific article; zbMATH DE number 1370593 (Why is no real title available?)
• scientific article; zbMATH DE number 5272192 (Why is no real title available?)
• On groups whose orders are products of three prime factors.
• On the abstract groups of order 32.
• On the determination of groups whose order is a power of a prime.
• On the groups of cube-free order.
• On the number of groups of order 1024
• Substitutionentheorie und ihre Anwendungen auf die Algebra.
• The \(p\)-group generation algorithm
• The composition of the finite groups whose degree is the fifth power of a prime.
• The enumeration of groups of order \(p^{n}q\) for \(n\leq 5\)
• The finite groups of cube-free order.
• The groups of order p^2q^2, where p is a prime greater than the prime q.
• The groups with order p^7 for odd prime p.
• The Magma algebra system. I: The user language
• Über die \(\Phi\)-Untergruppe endlicher Gruppen

This page was built for publication: Classification of finite groups: recent developements and open problems

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