Bounds on the diameter of Cayley graphs of the symmetric group
From MaRDI portal
Publication:402925
DOI10.1007/S10801-013-0476-3zbMATH Open1297.05107arXiv1205.1596OpenAlexW2142561347MaRDI QIDQ402925FDOQ402925
Authors: John Bamberg, Nick Gill, Thomas P. Hayes, Pablo Spiga, Harald A. Helfgott, Ákos Seress 
Publication date: 29 August 2014
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Abstract: In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for sets of generators containing a permutation fixing at least 37% of the points.
Full work available at URL: https://arxiv.org/abs/1205.1596
Recommendations
- On the diameter of the symmetric group: polynomial bounds.
- On the diameter of Cayley graphs of the symmetric group
- On the diameter of permutation groups
- scientific article; zbMATH DE number 1245638
- Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
Cites Work
- Title not available (Why is that?)
- Growth and generation in \(\text{SL}_2(\mathbb{Z}/p\mathbb{Z})\).
- Growth in finite simple groups of Lie type
- Approximate subgroups of linear groups.
- Two local conditions on the vertex stabiliser of arc-transitive graphs and their effect on the Sylow subgroups
- On the diameter of permutation groups.
- Maximal independent generating sets of the symmetric group
- On the diameter of Cayley graphs of the symmetric group
- On the diameter of the symmetric group: polynomial bounds.
- On the diameter of permutation groups
- Growth in \(\mathrm{SL}_3(\mathbb Z/p\mathbb Z)\).
- Probabilistic methods in group theory
- Graphs with automorphism groups admitting composition factors of bounded rank
- Growth of small generating sets in \(\mathrm{SL}_n(\mathbb Z/p\mathbb Z)\).
- On the diameter of Eulerian orientations of graphs
- The Degree and Class of Multiply Transitive Groups, III
- Title not available (Why is that?)
Cited In (20)
- On the diameter of a Cayley graph of a simple group of Lie type based on a conjugacy class
- Uniform diameter bounds for some families of Cayley graphs
- Primitive groups synchronize non-uniform maps of extreme ranks
- On the diameter of the symmetric group: polynomial bounds.
- On the diameter of permutation groups
- Expansion in finite simple groups of Lie type.
- Conjugation diameter of the symmetric groups
- Growth in groups: ideas and perspectives
- Bounded dilation maps of hypercubes into Cayley graphs on the symmetric group
- On the diameter and bisector size of Cayley graphs
- Upper bounds for the diameter of a direct power of non-abelian solvable groups
- Permutations of bounded degree generate groups of polynomial diameter
- Diameter of Cayley graphs of \(\mathrm{SL}(n,p)\) with generating sets containing a transvection
- Mini-workshop: Growth and expansion in groups. Abstracts from the mini-workshop held April 7--12, 2024
- The diameter of power graphs of symmetric groups
- Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group
- Word length perturbations in certain symmetric presentations of dihedral groups
- A bound on the diameter of the Brauer graph of a block of a solvable group
- An isoperimetric inequality for conjugation-invariant sets in the symmetric group
- On the diameter of Cayley graphs of the symmetric group
Uses Software
This page was built for publication: Bounds on the diameter of Cayley graphs of the symmetric group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402925)
