Classification of finite groups: recent developements and open problems (Q6880491)

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.