满足某些不等式条件的置换的计数

The enumeration of the permutation to satisfy some inequality conditions

设π是 {1,2 ,… ,n}上的一个置换 ,i,j是两个固定整数 ,本文利用车多项式对满足条件π(k) {k+i,n -k+j(modn)

Let π be a permutation of ｛1,2,…,n｝ such that π(k) ｛k+i,n-k+j(modn)｝ and it was counted by using rook polynomials.