Recurrence relations and two-dimensional set partitions.
Mansour, Toufik, Munagi, Augustine, Shattuck, Mark (2011)
Journal of Integer Sequences [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Higher chain formula proved by combinatorics.”
Recurrence relations and two-dimensional set partitions.
Sets, lists and noncrossing partitions.
Callan, David (2008)
Journal of Integer Sequences [electronic only]
Similarity:
Matrix compositions.
Munarini, Emanuele, Poneti, Maddalena, Rinaldi, Simone (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Combinatorics of partial derivatives.
Hardy, Michael (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The weighted hook length formula. III: Shifted tableaux.
Konvalinka, Matjaž (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Partitions in Cartesian systems
Václav Havel (1966)
Časopis pro pěstování matematiky
Similarity:
Nonhomogeneous parking functions and noncrossing partitions.
Armstrong, Drew, Eu, Sen-Peng (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Enumeration of partitions by long rises, levels, and descents.
Mansour, Toufik, Munagi, Augustine O. (2009)
Journal of Integer Sequences [electronic only]
Similarity:
Hybrid proofs of the -binomial theorem and other identities.
Eichhorn, Dennis, McLaughlin, James, Sills, Andrew V. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting subwords in a partition of a set.
Mansour, Toufik, Shattuck, Mark, Yan, Sherry H.F. (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity: