Invariable generation of the symmetric group

DOI10.1215/00127094-0000007XMaRDI QIDQ2012195zbMATH OpenFDO

Authors Sean Eberhard, Kevin Ford, Ben Green

Publication date 28 July 2017

Published in Duke Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1508.01870

zbMATH Keywords

symmetric groupinvariable generationrandom generators

Mathematics Subject Classification ID

Combinatorial probability (60C05) Symmetric groups (20B30) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05) Combinatorial aspects of groups and algebras (05E16)

Abstract: We say that permutations $p{i}_1,dots,p{i}_{r}inmathcal{S}_n$ invariably generate $mathcal{S}_n$ if, no matter how one chooses conjugates $pi{\text{'}}_1,dots,pi{\text{'}}_r$ of these permutations, $pi{\text{'}}_1,dots,pi{\text{'}}_r$ generate $mathcal{S}_n$. We show that if $p{i}_1,p{i}_2,p{i}_3$ are chosen randomly from $mathcal{S}_n$ then, with probability tending to 1 as $nightarrowinfty$, they do not invariably generate $mathcal{S}_n$. By contrast it was shown recently by Pemantle, Peres and Rivin that four random elements do invariably generate $mathcal{S}_n$ with positive probability. We include a proof of this statement which, while sharing many features with their argument, is short and completely combinatorial.

Recommendations

• On Random Generation of the Symmetric Group
• scientific article; zbMATH DE number 1047740
• Random sets which invariably generate the symmetric group
• scientific article; zbMATH DE number 5150116
• Invariable generation of permutation and linear groups

Cited in

(16)

• On invariable generation of alternating groups by elements of prime and prime power order
• The invariably generating graph of the alternating and symmetric groups
• Invariable generation of permutation and linear groups
• On the probability of generating invariably a finite simple group
• Invariable generation does not pass to finite index subgroups
• A note on invariable generation of nonsolvable permutation groups
• Random sets which invariably generate the symmetric group
• Minimal invariable generating sets
• Multiplicative arithmetic functions and the generalized Ewens measure
• The characteristic polynomial of a random matrix
• Irreducible polynomials of bounded height
• Invariable generation of finite classical groups
• Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
• Products of derangements in simple permutation groups
• Ewens sampling and invariable generation
• Divisibility of binomial coefficients and generation of alternating groups

This page was built for publication: Invariable generation of the symmetric group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2012195)