Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $G=(V,E)$ be a graph. The gradient of a function $f:V\longrightarrow R$ is defined on the edges of the graph, given by the discrete derivative $$ \nabla f(e)=f(y)-f(x), \quad e=(x,y) \in E $$

Take $V=S_{2n}$ the group of permutations $\pi$ of the set $\{1, \ldots 2n\}$ and $e=(\pi, \pi \tau) \in E$ for any transposition $\tau$.

I am trying to find a lower bound of the spectral gap of the graph $(S_{2n}, E)$. I guess it should be well-known. Any literature would be very helpful.

Thank you.

share|cite|improve this question
Does "some transposition" mean "some given transposition" or "any transposition"? – joriki Jul 29 '12 at 21:11
@joriki: Thank you. For any transposition. – Nick G.H. Jul 29 '12 at 21:12
up vote 0 down vote accepted

Papers by Persi Diaconis and co-authors in general, and in particular Comparison Techniques for Random Walk on Finite Groups, Persi Diaconis and Laurent Saloff-Coste, Ann. Probab. Volume 21, Number 4 (1993), 2131-2156.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.