MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

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

Suppose $ S_{n,N} $ be the set of $n$ elements with $N$ many cycles where $N$ is proportional to $n$. $U_{n,N}$ is an element picked randomly from this. It is known that the length of any cycle cannot be too large. What if we restrict the cycle lengths to be odd and then pick uniformly from this? Should it be also be that there are no cycles with huge length w.h.p?

I can prove this is the case if cycle lengths are all even. Is there any known reference for this?


share|cite|improve this question
Please edit your question to clarify it. Is $S$ a "set of $n$ elements" as you say, or a set of permutations of $n$ elements? And should "with $N$ many cycles" be "with $N$ cycles"? – Brendan McKay May 14 '12 at 3:05
@gmath: It would also be nice to have the references of the two results you mentioned. – John Jiang May 14 '12 at 5:25
Do you mean that fixing the constant of proportionality between $n$ and $N$ and letting $n$ grow, there is a size $C$ so that with probability approaching $1$ the longest cycle is shorter than $C$ (or $C \log{n}$ or something like that?) Be more specific please. – Aaron Meyerowitz May 14 '12 at 6:10
Although I don't see all of the details, the result for odd cycles should follow from the result for even cycles by combining pairs of cycles of odd length into cycles of even length. – Douglas Zare May 14 '12 at 14:49
@Brendan: Yes you are right. $S_{n,N}$ is the set of permutations of a set of $n$ elements with $N$ cycles. Sorry for being sloppy. – gmath May 15 '12 at 0:55

Your Answer


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

Browse other questions tagged or ask your own question.