ECO method and hill-free generalized Motzkin paths.
Barcucci, Elena, Pergola, Elisa, Pinzani, Renzo, Rinaldi, Simone (2001)
Séminaire Lotharingien de Combinatoire [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 “Some bijections and identities for the Catalan and Fine numbers.”
ECO method and hill-free generalized Motzkin paths.
Counting peaks at height in a Dyck path.
Mansour, Toufik (2002)
Journal of Integer Sequences [electronic only]
Similarity:
The factor for multi-dimensional lattice paths with diagonal steps.
Duchi, E., Sulanke, R.A. (2004)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
On generalized Dyck paths.
Rukavicka, Josef (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nonintersecting lattice paths on the cylinder.
Fulmek, Markus (2004)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
A staircase illumination theorem for orthogonal polygons.
Breen, Marilyn (2007)
Beiträge zur Algebra und Geometrie
Similarity:
Paths and tableaux descriptions of Jacobi-Trudi determinant associated with quantum affine algebra of type .
Nakai, Wakako, Nakanishi, Tomoki (2007)
SIGMA. Symmetry, Integrability and Geometry: Methods and Applications [electronic only]
Similarity:
On the powers of Motzkin paths.
Zeng, Jiang (2000)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Bijective proofs for Schur function identities which imply Dodgson's condensation formula and Plücker relations.
Fulmek, Markus, Kleber, Michael (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Matrix tableau-pairs with key and shuffling conditions.
Azenhas, Olga, Mamede, Ricardo (2006)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
The major counting of nonintersecting lattice paths and generating functions for tableaux. (Summary).
Krattenthaler, C. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Diameter in walk graphs.
Vetrík, T. (2007)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Efficient offline algorithmic techniques for several packet routing problems in distributed systems.
Andreica, Mugurel Ionuţ, Ţăpuş, Nicolae (2009)
Acta Universitatis Apulensis. Mathematics - Informatics
Similarity: