Applications of character estimates to statistical problems for symmetric group

DOI10.1007/s00493-012-2502-9zbMath1299.05166OpenAlexW2050269331MaRDI QIDQ2448934

Jan-Christoph Schlage-Puchta

Publication date: 5 May 2014

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-012-2502-9

zbMATH Keywords

Cayley graphsymmetric groupalternating groupcombinatorial probabilityLas Vegas probabilistic algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Randomized algorithms (68W20) Symmetric groups (20B30)

Related Items (6)

Random generation of the special linear group ⋮ Random generators of the symmetric group: diameter, mixing time and spectral gap. ⋮ Babai's conjecture for high-rank classical groups with random generators ⋮ Application of character estimates to the number of \(\mathrm{T}_2\)-systems of the alternating group ⋮ Navigating directed Cayley graphs of small diameter: A potent Solovay–Kitaev procedure ⋮ Growth in groups: ideas and perspectives

Cites Work

• Unnamed Item
• On the diameter of Cayley graphs of the symmetric group
• Fast constructive recognition of a black box group isomorphic to \(S_n\) or \(A_n\) using Goldbach's conjecture
• Character theory of symmetric groups, subgroup growth of Fuchsian groups, and random walks.
• On the diameter of Eulerian orientations of graphs
• On the Diameter of Random Cayley Graphs of the Symmetric Group
• On some problems of a statistical group-theory. II
• The probability of generating the symmetric group
• The probability of generating the symmetric group

This page was built for publication: Applications of character estimates to statistical problems for symmetric group