On the enumeration of finite groups
Let \(G(n)\) denote the number of non-isomorphic groups of order \(n\). Using methods of analytic number theory and an explicit algebraic equation of Hölder, the authors derive interesting asymptotic information about \(G(n)\) when \(n\) is square-free. The main results are: \[ G(n) = \Omega(n^{1-\varepsilon})\text{ for every \(\varepsilon > 0\) when \(n\) is square-free,} \tag{i} \] \[ \log G(n) = (1+o(1))\;\log\log n\sum_{p\mid n}(\log p)/(p-1) \tag{ii} \] for almost all square-free \(n\). In addition, they derive asymptotic estimates for \(F_k(x)\) where \(F_k(x)=\text{card}\{n\leq x: G(n)=k\}\): \[ F_k(x) = (c(a)+o(1)) x/(\log\log\log x)^{a+1}\text{ for } k = 2^a, \] \[ F_k(x) = O(x/(\log\log x)^{1-\varepsilon})\text{ for } k\neq 2^a, \] where \(c(a)\) is an appropriate constant.
- AN ENUMERATION THEOREM FOR FINITE GROUPS
- scientific article; zbMATH DE number 3670537 (Why is no real title available?)
- scientific article; zbMATH DE number 3467229 (Why is no real title available?)
- scientific article; zbMATH DE number 3063029 (Why is no real title available?)
- On groups of squarefree order
- On the number of groups of a given order
- Counting groups: Gnus, Moas, and other exotica
- Enumeration formulae for the number of finite groups and their applications
- On the enumeration of finite Abelian and solvable groups.
- On the congruence \(1^m + 2^m + \ldots + m^m\equiv n \bmod m\) with \(n\mid m\)
- ENUMERATING FINITE GROUPS
- scientific article; zbMATH DE number 1467459 (Why is no real title available?)
- On the Average Number of Groups of Square-Free Order
- Numbers which are orders only of cyclic groups
- scientific article; zbMATH DE number 5272192 (Why is no real title available?)
- scientific article; zbMATH DE number 3108279 (Why is no real title available?)
- On groups of squarefree order
This page was built for publication: On the enumeration of finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087908)
