Asymptotic results for primitive permutation groups

From MaRDI portal





Estimates for the number (up to permutation equivalence) of finite primitive permutation groups of a given degree \(n\) are obtained. It is shown that this number is at most \(n^{c/m(n)}\) where \(m(n)\) is the maximal exponent occurring in the prime factorization of \(n\) and \(c\) is an absolute constant. This result is applied in deriving a bound for the maximal subgroup growth of a finitely generated infinite group. It is also shown that the order of a finite primitive group \(G\) is bounded by a polynomial in \(n\) of degree depending on \(d\) provided that a point stabilizer \(G_\alpha\) has no section isomorphic to the alternating group \(\text{Alt}(d)\). Further order bounds are derived, also for transitive permutation groups.



Cites work









This page was built for publication: Asymptotic results for primitive permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355504)