Four random permutations conjugated by an adversary generateSnwith high probability

DOI10.1002/rsa.20632zbMath1349.05337arXiv1412.3781OpenAlexW2963607991MaRDI QIDQ2830234

Yuval Peres, Igor Rivin, Robin Pemantle

Publication date: 9 November 2016

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

cycleGalois groupdimensionsumsetPoisson

Mathematics Subject Classification ID

Related Items (15)

A note on invariable generation of nonsolvable permutation groups ⋮ Products of derangements in simple permutation groups ⋮ Ewens Sampling and Invariable Generation ⋮ Irreducible polynomials of bounded height ⋮ Irreducibility of random polynomials: general measures ⋮ Methodologies of Symbolic Computation ⋮ On the probability of generating invariably a finite simple group ⋮ Invariable generation does not pass to finite index subgroups ⋮ The invariably generating graph of the alternating and symmetric groups ⋮ Invariable generation of permutation and linear groups ⋮ Invariable generation of finite classical groups ⋮ Minimal invariable generating sets ⋮ Analyticity for rapidly determined properties of Poisson Galton-Watson trees ⋮ The characteristic polynomial of a random matrix ⋮ On invariable generation of alternating groups by elements of prime and prime power order

Cites Work

• Cycle lengths in a permutation are typically Poisson
• Quelques applications du théorème de densité de Chebotarev
• Random sets which invariably generate the symmetric group
• The cycle structure of random permutations
• On tail probabilities for martingales
• Fast recognition of alternating and symmetric Galois groups
• Die Seltenheit der Gleichungen mit Affekt
• On the Efficiency of a Polynomial Irreducibility Test
• On Random Generation of the Symmetric Group

This page was built for publication: Four random permutations conjugated by an adversary generateS_nwith high probability