Generating minimally transitive groups
Let \(G\leq S_n\) be a finite transitive permutation group of degree \(n\). \(G\) is said to be minimally transitive iff \(G\) has no proper transitive subgroups. Let \(n=\prod p_i^{a_i}\) be the prime factorization of \(n\). Then \(\lambda(n):=\sum a_i\) and \(\mu(n):=\max a_i\). The following results are obtained. Theorem. Let \(G\) be a minimally transitive subgroup of \(S_n\). If \(\mu(n)+1\) elements are not sufficient to generate \(G\) then \(\lambda(n)\geq 2\) and \(G\) can be generated by \([\log_2(\lambda(n)-1)+3]\) elements. Corollary. Any solvable minimally transitive subgroup of \(S_n\) can be generated by \(\mu(n)+1\) elements. The approach relies on some recent results on the minimal number of generators of a finite group most of which are based on the classification of finite simple groups. For the entire collection see [Zbl 0883.00017].
- Permutation groups generated by a transposition and another element
- Minimal generation of transitive permutation groups
- Asymptotic results for primitive permutation groups and irreducible linear groups.
- On solvable minimally transitive permutation groups.
- The size of a minimal generating set for primitive \(\frac{3}{2} \)-transitive groups
- Generating minimally transitive permutation groups.
This page was built for publication: Generating minimally transitive groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4385469)
