Pages that link to "Item:Q1333156"
From MaRDI portal
The following pages link to Computing a set of generators of minimal cardinality in a solvable group (Q1333156):
Displaying 12 items.
- The largest size of a minimal generating set of a finite group. (Q359620) (← links)
- The construction of finite solvable groups revisited. (Q402704) (← links)
- Invariable generation with elements of coprime prime-power orders. (Q479775) (← links)
- Special polycyclic generating sequences for finite soluble groups. (Q2643571) (← links)
- THE GROUPS OF ORDER q<sup>n</sup>· p (Q2752399) (← links)
- Generating Permutation Groups (Q3155509) (← links)
- (Q4389857) (← links)
- MINIMAL NUMBER OF GENERATORS AND COMPOSITION LENGTH OF SOCLE IN FINITE GROUPS (Q4883686) (← links)
- An algorithm for finding minimal generating sets of finite groups (Q5076993) (← links)
- Computing generating sets of minimal size in finite algebras (Q6108373) (← links)
- The minimum generating set problem (Q6142842) (← links)
- Semiregularity and connectivity of the non-𝔉 graph of a finite group (Q6168136) (← links)