Minimal invariable generating sets
From MaRDI portal
Publication:2318385
Abstract: A subset of a group invariably generates if, when each element of is replaced by an arbitrary conjugate, the resulting set generates An invariable generating set of is called minimal if no proper subset of invariably generates We will address several questions related to the behaviour of minimal invariable generating sets of a finite group.
Recommendations
Cites work
- A generalization of the Burnside basis theorem.
- A theorem on random matrices and some applications
- An interpolation theorem for irredundant bases of closure structures
- Classes of Finite Groups
- Convergence Groups are not Invariably Generated
- Crowns and centralizers of chief factors of finite groups
- Crowns and factorization of the probabilistic zeta function of a finite group.
- Die Eulersche Funktion endlicher auflösbarer Gruppen
- Ewens sampling and invariable generation
- Finite Groups in Which Every Element Has Prime Power Order
- Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
- Generating random elements of a finite group
- scientific article; zbMATH DE number 3739805 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 1981750 (Why is no real title available?)
- scientific article; zbMATH DE number 3294681 (Why is no real title available?)
- Independent generating sets and geometries for symmetric groups
- Invariable generation and the Chebotarev invariant of a finite group.
- Invariable generation of infinite groups.
- Invariable generation of the symmetric group
- Invariable generation with elements of coprime prime-power orders.
- Maximal independent generating sets of the symmetric group
- Maximal subgroups of symmetric groups
- Minimal generating sets of maximal size in finite monolithic groups.
- On complemented nonabelian chief factors of a finite group
- On Finite Groups With ‘Hidden’ Primes
- On Groups all of Whose Elements Have Prime Power Order
- On Random Generation of the Symmetric Group
- Pre-Frattini groups.
- Random sets which invariably generate the symmetric group
- Secretive prime-power groups of large rank
- Simple groups admit Beauville structures.
- The Chebotarev invariant of a finite group: a conjecture of Kowalski and Zywina
- The congruence subgroup property does not imply invariable generation
- The largest size of a minimal generating set of a finite group.
- The minimal generating sets of \(\mathrm{PSL}(2,p)\) of size four.
- Transitive groups with fixed-point free permutations
- Zu einem von B. H. und H. Neumann gestellten Problem
Cited in
(12)- Invariable generation and wreath products
- Invariant \(K\)-minimal sets in the discrete and continuous settings
- Minimal generating sets of directed oriented Reidemeister moves
- The largest size of a minimal generating set of a finite group.
- Invariable generation of infinite groups.
- CONNECTED COMPONENTS IN THE INVARIABLY GENERATING GRAPH OF A FINITE GROUP
- Invariable generation of Thompson groups
- Invariable generation of groups of finite rank
- On invariable generation of alternating groups by elements of prime and prime power order
- Minimal generating sequences of \(\mathfrak{F}\)-subgroups
- Large minimal invariable generating sets in the finite symmetric groups
- A class of rearrangement groups that are not invariably generated
This page was built for publication: Minimal invariable generating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2318385)