A simple proof of the Aztec diamond theorem.
Eu, Sen-Peng, Fu, Tung-Shan (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Semiorders and Riordan numbers.”
A simple proof of the Aztec diamond theorem.
Conjectured combinatorial models for the Hilbert series of generalized diagonal harmonic modules.
Loehr, Nicholas A., Remmel, Jeffrey B. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A combinatorial representation with Schröder paths of biorthogonality of Laurent biorthogonal polynomials.
Kamioka, Shuhei (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Multiple pattern avoidance with respect to fixed points and excedances.
Elizalde, Sergi (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the dominance partial ordering of Dyck paths.
Sapounakis, A., Tasoulas, I., Tsikouras, P. (2006)
Journal of Integer Sequences [electronic only]
Similarity:
An inverse matrix formula in the right-quantum algebra.
Konvalinka, Matjaz (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lattice path proofs of extended Bressoud-Wei and Koike skew Schur function identities.
Hamel, A.M., King, R.C. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A combinatorial interpretation of the area of Schröder paths.
Pergola, E., Pinzani, R. (1999)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Conjectured statistics for the higher -Catalan sequences.
Loehr, Nicholas A. (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Counting segmented permutations using bicoloured Dyck paths.
Claesson, Anders (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pattern avoiding partitions and Motzkin left factors
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...
An area-to-inv bijection between Dyck paths and 312-avoiding permutations.
Bandlow, Jason, Killpatrick, Kendra (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bijective recurrences concerning Schröder paths.
Sulanke, Robert A. (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity: