An isoperimetric inequality for conjugation-invariant sets in the symmetric group
From MaRDI portal
Publication:2630863
Abstract: We prove an isoperimetric inequality for conjugation-invariant sets of size in , showing that these necessarily have edge-boundary considerably larger than some other sets of size (provided is small). Specifically, let denote the Cayley graph on generated by the set of all transpositions. We show that if is a conjugation-invariant set with , then the edge-boundary of in has size at least c cdot frac {log_2 ( frac 1{p})}{log_2 log_2 ( frac 2{p})}cdot n cdot |A|, where is an absolute constant. (This is sharp up to an absolute constant factor, when for any .) It follows that if , then the edge-boundary of a conjugation-invariant set of measure is necessarily a factor of larger than the minimum edge-boundary over all sets of measure .
Recommendations
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- A note on the edges of the n-cube
- A quasi-stability result for dictatorships in S_n
- Assignment of Numbers to Vertices
- Generating a random permutation with random transpositions
- scientific article; zbMATH DE number 3771876 (Why is no real title available?)
- scientific article; zbMATH DE number 18980 (Why is no real title available?)
- Logarithmic combinatorial structures: A probabilistic approach
- Maximally Connected Arrays on the n-Cube
- Optimal Assignments of Numbers to Vertices
Cited in
(3)
This page was built for publication: An isoperimetric inequality for conjugation-invariant sets in the symmetric group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630863)