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 k in Sn, showing that these necessarily have edge-boundary considerably larger than some other sets of size k (provided k is small). Specifically, let Tn denote the Cayley graph on Sn generated by the set of all transpositions. We show that if AsubsetSn is a conjugation-invariant set with |A|=pn!leqn!/2, then the edge-boundary of A in Tn has size at least c cdot frac {log_2 ( frac 1{p})}{log_2 log_2 ( frac 2{p})}cdot n cdot |A|, where c is an absolute constant. (This is sharp up to an absolute constant factor, when p=Theta(1/s!) for any sin1,2,...,n.) It follows that if p=n−Theta(1), then the edge-boundary of a conjugation-invariant set of measure p is necessarily a factor of Omega(logn/loglogn) larger than the minimum edge-boundary over all sets of measure p.












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)