#### Filter Results:

#### Publication Year

2005

2008

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a one-to-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the… (More)

We give a combinatorial interpretation of a matrix identity on Catalan numbers and the sequence (1, 4, 4 2 , 4 3 ,. . .) which has been derived by Shapiro, Woan and Getu by using Riordan arrays. By giving a bijection between weighted partial Motzkin paths with an elevation line and weighted free Motzkin paths, we find a matrix identity on the number of… (More)

A 2-binary tree is a binary rooted tree whose root is colored black and the other vertices are either black or white. We present several bijections concerning different types of 2-binary trees as well as other combinatorial structures such as ternary trees, non-crossing trees, Schröder paths, Motzkin paths and Dyck paths. We also obtain a number of… (More)

Many interesting combinatorial objects are enumerated by the k-Catalan numbers, one possible generalization of the Catalan numbers. We will present a new combinatorial object that is enumerated by the k-Catalan numbers, staircase tilings. We give a bijection between staircase tilings and k-good paths, and between k-good paths and k-ary trees. In addition,… (More)

The aim in this paper is to collect in one place a list of currently known and new structures enumerated by the k-ary numbers. Some of the structures listed already exist in the folklore , especially those that are easy generalizations of known combinatorial structures enumerated by the Catalan numbers. We will provide outlines on how the proofs for the… (More)

In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (0, 2) to (2n, 0). As a consequence, the refined enumeration of 1123-avoiding matchings can be reduced to the enumeration of certain lattice paths. Another result of this paper is a… (More)

- R Sprugnoli, W Y C Chen, N Y Li, L W Shapiro, S H F Yan
- 2008

references to books and papers on that subject. In this way, I'll be able to update periodically this bibliography. Thanks. [5] P. Barry. On a family of generalized Pascal triangles defined by exponential Riordan arrays. On a one-parameter family of Riordan arrays and the weight distribution of MDS codes.

This list is a compilation of combinatorial structures enumerated by the k-Catalan numbers C k n = 1 kn + 1 kn + 1 n = 1 (k − 1)n + 1 kn n for any positive integers k and n. We start by giving known combinatorial structures, together with references to where a proof can be found. The remainder of the list consists of new structures that are generalizations… (More)

- ‹
- 1
- ›