A study of Eulerian numbers by means of an operator on permutations
暂无分享,去创建一个
[1] David Thomas,et al. The Art in Computer Programming , 2001 .
[2] Donald E. Knuth,et al. The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .
[3] D. Foata,et al. Theorie Geometrique des Polynomes Euleriens , 1970 .
[4] Adalbert Kerber,et al. Algebraic combinatorics via finite group actions , 1991 .
[5] Shinji Tanimoto. An Operator on Permutations and its Application to Eulerian Numbers , 2001, Eur. J. Comb..
[6] Ronald L. Graham,et al. Concrete mathematics - a foundation for computer science , 1991 .
[7] Jean-Louis Nicolas,et al. On the eulerian numbers Mn=max 1≤k≤n A(n, k) , 1992, Eur. J. Comb..
[8] Donald E. Knuth,et al. The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .