Minimal and random generation of permutation and matrix groups.
Let \(G\) be a finite group and \(\varepsilon>0\). Then \(d(G)\) denotes the size of the smallest generating set and \(d^\varepsilon(G)\) denotes the least integer \(k\) such that a list of \(k\) random elements from \(G\) generates \(G\) with probability \(>1-\varepsilon\). \textit{A. Lubotzky} [J. Algebra 257, No. 2, 452-459 (2002; Zbl 1042.20047)] has shown that \(d(G)\leq d^\varepsilon(G)\leq d(G)+2\log\log|G|+t+2\) when the value of the Riemann zeta function \(\zeta(t)\leq 1+\varepsilon\) (except where noted, all logarithms in this review are to base \(2\)). With applications to computations in mind, the authors are interested in obtaining upper bounds on \(d(G)\) (and hence on \(d^\varepsilon(G)\)) with explicit constants for various classes of permutation groups and linear groups. Here are some examples. (Theorem 1.1) If \(H\) is a subnormal subgroup of a primitive permutation group of degree \(n>3\), then \(d(H)\leq\log n\). (Theorem 1.2) If \(G\) is a finite completely reducible linear group of degree \(n\) over a field \(F\) which does not contain a primitive \(4\)-th root of \(1\), then \(d(G)\leq n\). (Theorem 1.3) If \(G\) is a finite quasiprimitive linear group of degree \(n\), then \(d(G)\leq 1+\lceil(2\log_32)\log n\rceil\). Exampes show that these bounds are close to best possible. Proofs depend heavily on the classification of finite simple groups and often require a case-by-case examination.
- The expected number of elements to generate a finite group with \(d\)-generated Sylow subgroups
- How many elements are needed to generate a finite group with good probability?
- Comparing the order and the minimal number of generators of a finite irreducible linear group
- The expected number of random elements to generate a finite group.
- Generation and random generation: from simple groups to maximal subgroups.
- Invariable generation and the Chebotarev invariant of a finite group.
- Minimal generation of transitive permutation groups
- The probability of generating a permutation group.
- A data structure for a uniform approach to computations with finite groups
- Asymptotic results for primitive permutation groups and irreducible linear groups.
- Certain maximal characteristic subgroups of the free group of rank 2
- Chains of subgroups in symmetric groups
- Corrigenda: Low-dimensional Representations of Quasi-simple Groups
- Crowns and factorization of the probabilistic zeta function of a finite group.
- Endliche Gruppen I
- Generating Finite Completely Reducible Linear Groups
- Generation of almost simple groups
- Generation of classical groups
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 3933295 (Why is no real title available?)
- scientific article; zbMATH DE number 46357 (Why is no real title available?)
- scientific article; zbMATH DE number 3582393 (Why is no real title available?)
- scientific article; zbMATH DE number 775176 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3294681 (Why is no real title available?)
- On the maximal subgroups of the finite classical groups
- On the number of generators and composition length of finite linear groups
- On the number of generators of a finite group
- Small Degree Representations of Finite Chevalley Groups in Defining Characteristic
- Some applications of the first cohomology group
- The computational matrix group project.
- The expected number of random elements to generate a finite group.
- The Magma algebra system. I: The user language
- The Number of Generators of a Linear p-Group
- Minimal generation of transitive permutation groups
- Invariable generation of permutation and linear groups
- The expected number of random elements to generate a finite group.
- How many elements are needed to generate a finite group with good probability?
- The probability of generating a permutation group.
- d-wise generation of prosolvable groups.
- Asymptotic results for primitive permutation groups and irreducible linear groups.
- Primitive normalisers in quasipolynomial time
- Comparing the order and the minimal number of generators of a finite irreducible linear group
- Finite groups with large Chebotarev invariant
- Maximal subgroups of finite groups avoiding the elements of a generating set
- Generation and random generation: from simple groups to maximal subgroups.
- The size of a minimal generating set for primitive \(\frac{3}{2} \)-transitive groups
- Probabilistic generation of finite groups with a unique minimal normal subgroup.
- Proportions of r-regular elements in finite classical groups.
- Generating minimally transitive permutation groups.
- Generating Permutation Groups
- scientific article; zbMATH DE number 720909 (Why is no real title available?)
- A practical model for computation with matrix groups.
- Normalisers of primitive permutation groups in quasipolynomial time
- The minimum generating set problem
- Random generation of finite and profinite groups and group enumeration.
This page was built for publication: Minimal and random generation of permutation and matrix groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2438897)
