On Random Generation of the Symmetric Group

DOI10.1017/S0963548300000869MaRDI QIDQ4290100zbMATHFDO

Authors Tomasz Łuczak, Laszló Pyber

Publication date 31 July 1995

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

probabilitysymmetric groupsinvariable generationrandom permutationstransitive subgroupscomputational Galois theory

Mathematics Subject Classification ID

Combinatorial probability (60C05) General theory for finite permutation groups (20B05) Symmetric groups (20B30) Generators, relations, and presentations of groups (20F05) Probabilistic methods in group theory (20P05)

Recommendations

• Random sets which invariably generate the symmetric group
• scientific article; zbMATH DE number 1047740
• Invariable generation and the Chebotarev invariant of a finite group.
• The Chebotarev invariant of a finite group.
• Four random permutations conjugated by an adversary generate \(\mathcal{S}_{n}\) with high probability
• A note on invariable generation of nonsolvable permutation groups
• The probability of generating the symmetric group
• Comparing the expected number of random elements from the symmetric and the alternating groups needed to generate a transitive subgroup
• Publication:4952678
• Minimal generation of transitive permutation groups

Cites work

• Almost all quasigroups have rank 2
• Asymptotic Development of the Stirling Numbers of the First Kind
• On growing random binary trees
• On some problems of a statistical group-theory. II
• On the order of uniprimitive permutation groups
• Random sets which invariably generate the symmetric group
• Some asymptotic results on finite vector spaces
• The Probability that some Power of a Permutation has Small Degree
• The probability of generating a finite classical group
• The probability of generating the symmetric group

Cited in

(42)

• Generating sets of finite groups
• Coprime invariable generation and minimal-exponent groups.
• On fixed points of permutations.
• Comparing the expected number of random elements from the symmetric and the alternating groups needed to generate a transitive subgroup
• Local-global invariants of finite and infinite groups: around Burnside from another side.
• Applications of character estimates to statistical problems for symmetric group
• Invariable generation and the Chebotarev invariant of a finite group.
• Covering and growth for group subsets and representations
• Invariable generation of the symmetric group
• When do random subsets decompose a finite group?
• 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
• Random generation with cycle type restrictions
• The classification of partition homogeneous groups with applications to semigroup theory
• A note on invariable generation of nonsolvable permutation groups
• scientific article; zbMATH DE number 5150116 (Why is no real title available?)
• Recent Advances in Constraints
• The Chebotarev invariant of a finite group: a conjecture of Kowalski and Zywina
• scientific article; zbMATH DE number 1047740 (Why is no real title available?)
• Random sets which invariably generate the symmetric group
• Permutations contained in transitive subgroups
• Bounds on the number and sizes of conjugacy classes in finite Chevalley groups with applications to derangements.
• The Chebotarev invariant of a finite group.
• Minimal invariable generating sets
• Derangements in finite classical groups for actions related to extension field and imprimitive subgroups and the solution of the Boston–Shalev conjecture
• Orbits of primitive \(k\)-homogeneous groups on \((n-k)\)-partitions with applications to semigroups
• Irreducibility of random polynomials: general measures
• A theorem on random matrices and some applications
• Dixon's theorem and random synchronization
• Irreducible polynomials of bounded height
• Invariable generation of finite classical groups
• The cycle structure of two rows in a random Latin square
• On the generating graphs of symmetric 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
• Imprimitive permutations in primitive groups
• Derangements in subspace actions of finite classical groups
• On the number of distinct functional graphs of affine-linear transformations over finite fields
• Solubilizers in profinite groups
• Fast recognition of alternating and symmetric Galois groups

This page was built for publication: On Random Generation of the Symmetric Group

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