Combinatorial Statistics on Non-crossing Partitions
暂无分享,去创建一个
[1] John Riordan,et al. Introduction to Combinatorial Analysis , 1958 .
[2] Rodica Simion,et al. On the structure of the lattice of noncrossing partitions , 1991, Discret. Math..
[3] S. Milne. Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers , 1982 .
[4] R. Stanley. What Is Enumerative Combinatorics , 1986 .
[5] D. Kleitman,et al. Proof techniques in the theory of finite sets , 1978 .
[6] Josef Hofbauer,et al. Communicated by the Managing Editors , 1972 .
[7] George E. Andrews,et al. Catalan numbers, q-Catalan numbers and hypergeometric series , 1987, J. Comb. Theory, Ser. A.
[8] Paul H. EDELMAN. Multichains, non-crossing partitions and trees , 1982, Discret. Math..
[9] Paul H. Edelman. Chain enumeration and non-crossing partitions , 1980, Discret. Math..
[10] Doron Zeilberger,et al. Denert's permutation statistic is indeed Euler-Mahonian , 1990 .
[11] D. Rawlings. The ABC's of classical enumeration , 1986 .
[12] Julian West,et al. Permutations with forbidden subsequences, and, stack-sortable permutations , 1990 .
[13] Rodica Simion,et al. Some q-analogues of the Schröder numbers arising from combinatorial statistics on lattice paths , 1993 .
[14] Jeffrey B. Remmel,et al. Q-counting rook configurations and a formula of frobenius , 1986, J. Comb. Theory A.
[15] Germain Kreweras,et al. Sur les partitions non croisees d'un cycle , 1972, Discret. Math..
[16] H. Gould. The $q$-Stirling numbers of first and second kinds , 1961 .
[17] Michelle L. Wachs,et al. p, q-Stirling numbers and set partition statistics , 1990, J. Comb. Theory A.
[18] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .