Pages that link to "Item:Q2438897"
From MaRDI portal
The following pages link to Minimal and random generation of permutation and matrix groups. (Q2438897):
Displaying 19 items.
- Generating minimally transitive permutation groups. (Q296672) (← links)
- A practical model for computation with matrix groups. (Q480641) (← links)
- Random generation of finite and profinite groups and group enumeration. (Q640754) (← links)
- Minimal generation of transitive permutation groups (Q1643178) (← links)
- Invariable generation of permutation and linear groups (Q1727710) (← links)
- The expected number of random elements to generate a finite group. (Q1858260) (← links)
- How many elements are needed to generate a finite group with good probability? (Q1860697) (← links)
- The probability of generating a permutation group. (Q1881572) (← links)
- \(d\)-wise generation of prosolvable groups. (Q1946099) (← links)
- Asymptotic results for primitive permutation groups and irreducible linear groups. (Q1969121) (← links)
- Primitive normalisers in quasipolynomial time (Q2071768) (← links)
- Comparing the order and the minimal number of generators of a finite irreducible linear group (Q2134028) (← links)
- Finite groups with large Chebotarev invariant (Q2303684) (← links)
- Maximal subgroups of finite groups avoiding the elements of a generating set (Q2413425) (← links)
- Generation and random generation: from simple groups to maximal subgroups. (Q2437517) (← links)
- Probabilistic generation of finite groups with a unique minimal normal subgroup. (Q2840161) (← links)
- Proportions of \(r\)-regular elements in finite classical groups. (Q2843988) (← links)
- (Q4322452) (← links)
- Normalisers of primitive permutation groups in quasipolynomial time (Q5112525) (← links)