ENUMERATING FINITE GROUPS
From MaRDI portal
Publication:3031002
DOI10.1093/qmath/38.4.473zbMath0627.20014OpenAlexW1989743096MaRDI 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
Arithmetic and combinatorial problems involving abstract finite groups (20D60) Asymptotic results on arithmetic functions (11N37) Asymptotic results on counting functions for algebraic and topological structures (11N45) Arithmetic functions; related numbers; inversion formulas (11A25)
Related Items (20)
Generating Permutation Groups ⋮ Invariable generation of prosoluble groups. ⋮ Enumerating finite groups without Abelian composition factors. ⋮ Enumerating finite groups and their defining relations. II. ⋮ Asymptotic enumeration of vertex-transitive graphs of fixed valency ⋮ Orbits of primitive $k$-homogenous groups on $(n-k)$-partitions with applications to semigroups ⋮ Algorithms in Algebraic Number Theory ⋮ The size of a minimal generating set for primitive \(\frac{3}{2} \)-transitive groups ⋮ The minimum generating set problem ⋮ On the minimal number of generators of endomorphism monoids of full shifts ⋮ Random generation of finite and profinite groups and group enumeration. ⋮ The minimal number of generators of a finite semigroup. ⋮ Discrete groups of slow subgroup growth ⋮ Enumerating finite groups and their defining relations ⋮ Enumerating boundedly generated finite groups. ⋮ Chains of subsemigroups ⋮ Bounding the minimal number of generators of groups and monoids of cellular automata ⋮ Linear optimization over permutation groups ⋮ A bound on the number of generators of a finite group ⋮ Groups satisfying a strong complement property
This page was built for publication: ENUMERATING FINITE GROUPS