ENUMERATING FINITE GROUPS

DOI10.1093/qmath/38.4.473zbMath0627.20014MaRDI QIDQ3031002

Peter M. Neumann, Annabelle McIver

Publication date: 1987

Published in: The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/qmath/38.4.473

zbMATH Keywords

upper bounds; solvable groups; number of groups; isomorphism types of groups

Mathematics Subject Classification ID

20D60: Arithmetic and combinatorial problems involving abstract finite groups

11N37: Asymptotic results on arithmetic functions

11N45: Asymptotic results on counting functions for algebraic and topological structures

11A25: Arithmetic functions; related numbers; inversion formulas

Related Items

Enumerating finite groups and their defining relations, Orbits of primitive $k$-homogenous groups on $(n-k)$-partitions with applications to semigroups, Enumerating boundedly generated finite groups., Invariable generation of prosoluble groups., Asymptotic enumeration of vertex-transitive graphs of fixed valency, The minimal number of generators of a finite semigroup., Random generation of finite and profinite groups and group enumeration., Discrete groups of slow subgroup growth, Enumerating finite groups and their defining relations. II., Linear optimization over permutation groups, A bound on the number of generators of a finite group, Chains of subsemigroups, Bounding the minimal number of generators of groups and monoids of cellular automata, Groups satisfying a strong complement property, Enumerating finite groups without Abelian composition factors., The size of a minimal generating set for primitive \(\frac{3}{2} \)-transitive groups, Generating Permutation Groups, Algorithms in Algebraic Number Theory