On the diameter of the symmetric group: polynomial bounds.
From MaRDI portal
Publication:5501375
Recommendations
- Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
- Bounds on the diameter of Cayley graphs of the symmetric group
- Random generators of the symmetric group: diameter, mixing time and spectral gap.
- Permutations of bounded degree generate groups of polynomial diameter
- Applications of character estimates to statistical problems for symmetric group
Cited in
(17)- Mini-workshop: Growth and expansion in groups. Abstracts from the mini-workshop held April 7--12, 2024
- Random generators of the symmetric group: diameter, mixing time and spectral gap.
- Permutations of bounded degree generate groups of polynomial diameter
- Computing short generator sequences
- Babai's conjecture for high-rank classical groups with random generators
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- On the diameter of permutation groups.
- Growth and expansion in algebraic groups over finite fields
- Bounds on the diameter of Cayley graphs of the symmetric group
- Some things we've learned (about Markov chain Monte Carlo)
- Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
- Random generation of the special linear group
- Navigating directed Cayley graphs of small diameter: a potent Solovay-Kitaev procedure
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Growth in groups: ideas and perspectives
- Diameter of Cayley graphs of \(\mathrm{SL}(n,p)\) with generating sets containing a transvection
- Probabilistic and asymptotic aspects of finite simple groups.
This page was built for publication: On the diameter of the symmetric group: polynomial bounds.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501375)
