Partitions, rooks, and symmetric functions in noncommuting variables.
Can, Mahir Bilen, Sagan, Bruce E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Can, Mahir Bilen, Sagan, Bruce E. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Rowell, Michael, Yee, Ae Ja (2009)
Integers
Similarity:
Jelínek, Vít, Mansour, Toufik (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hardy, Michael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zhou, Yue (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Zuber, J.-B. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vallejo, Ernesto (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hamel, A.M., King, R.C. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Toufik Mansour, Mark Shattuck (2011)
Open Mathematics
Similarity:
Let L n, n ≥ 1, denote the sequence which counts the number of paths from the origin to the line x = n − 1 using (1, 1), (1, −1), and (1, 0) steps that never dip below the x-axis (called Motzkin left factors). The numbers L n count, among other things, certain restricted subsets of permutations and Catalan paths. In this paper, we provide new combinatorial interpretations for these numbers in terms of finite set partitions. In particular, we identify four classes of the partitions of...
Di Francesco, P., Zinn-Justin, P. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ballantine, Cristina M., Orellana, Rosa C. (2005)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Cameron, Naiomi, Killpatrick, Kendra (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Adin, Ron M., Remmel, Jeffrey B., Roichman, Yuval (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity: