Pages that link to "Item:Q4646246"
From MaRDI portal
The following pages link to Bounding the composition length of primitive permutation groups and completely reducible linear groups (Q4646246):
Displaying 10 items.
- On the reconstruction index of permutation groups: general bounds (Q816927) (← links)
- How many elements are needed to generate a finite group with good probability? (Q1860697) (← links)
- On the composition length of finite primitive linear groups (Q1865715) (← links)
- Comparing the order and the minimal number of generators of a finite irreducible linear group (Q2134028) (← links)
- The number of composition factors of order \(p\) in completely reducible groups of characteristic \(p\) (Q2401713) (← links)
- Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree (Q5145118) (← links)
- Bounding the even abelian composition factors in finite linear groups (Q6117064) (← links)
- On the orders of composition factors in completely reducible groups (Q6123229) (← links)
- The minimum generating set problem (Q6142842) (← links)
- A subexponential bound on the cardinality of abelian quotients in finite transitive groups (Q6175060) (← links)
