Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

I need to find $m$ permutations $A_1,..,A_m$ where each $A_i$ is a permutation on $n$ objects such that any of the compositions $A_jA_{j+1}..A_{j+k}$; $1 \leq j \leq n-1$ and $j+k \leq m$ does not have a fixed point.

Does such a sequence of permutation always exist? If yes, is there a good way to generate such permutations? Do we have a name for such a sequence of permutations? Thanks for your time.

share|improve this question
add comment

1 Answer

up vote 4 down vote accepted

Of course such permutations exist if $n > m$ (just take each $A_i$ to be the same $n$-cycle). On the other hand if $m \le n$, a pigeonhole argument should give some pair of $A_1, A_1 A_2, A_1A_2A_3, \ldots$ mapping element $1$ to the same element, inducing a fixed point in the quotient of this pair. Are you sure this question is well-posed?

share|improve this answer
    
Yes, you are right. This was easy after all... Thanks. –  Hardik Udeshi Jun 13 '12 at 8:46
add comment

Your Answer

 
discard

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.