
This paper deals with the problem of enumerating the number f(n) of isomorphism types of groups of order n. There are three results which give upper bounds for f(n). The first bound holds for arbitrary groups, the second one deals with solvable groups, while the third one applies to groups with abelian Sylow subgroups. In this article similar methods are used as in a predecessor [ibid. 20, 395-401 (1969; Zbl 0204.347)] (for instance bounds for the order of certain degree 2 cohomology groups). The note also contains a detailed discussion of related results.
isomorphism types of groups, upper bounds, Arithmetic functions; related numbers; inversion formulas, number of groups, Asymptotic results on arithmetic functions, Asymptotic results on counting functions for algebraic and topological structures, Arithmetic and combinatorial problems involving abstract finite groups, solvable groups
isomorphism types of groups, upper bounds, Arithmetic functions; related numbers; inversion formulas, number of groups, Asymptotic results on arithmetic functions, Asymptotic results on counting functions for algebraic and topological structures, Arithmetic and combinatorial problems involving abstract finite groups, solvable groups
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 32 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
