An Operator on Permutations and its Application to Eulerian Numbers
暂无分享,去创建一个
We introduce an operator on permutations of 1, 2,? , n, which preserves the numbers of their ascents and descents. We investigate periods of permutations under the operator and structures of permutations with given periods. As its application we prove some congruence relations modulo a prime for Eulerian numbers.
[1] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[2] Adalbert Kerber,et al. Algebraic combinatorics via finite group actions , 1991 .
[3] Jean-Louis Nicolas,et al. On the eulerian numbers Mn=max 1≤k≤n A(n, k) , 1992, Eur. J. Comb..