Combinatorics of Generalized Motzkin Numbers
نویسندگان
چکیده
The generalized Motzkin numbers are common generalizations of the Motzkin numbers and the Catalan numbers. We investigate their combinatorial properties, including the combinatorial interpretation, the recurrence relation, the binomial transform, the Hankel transform, the log-convexity, the continued fraction of the generating function, and the total positivity of the corresponding Hankel matrix.
منابع مشابه
On some primary and secondary structures in combinatorics
A possible upgrade of a curriculum in undergraduate course in combinatorics is presented by giving more bijective proofs in the standard (or primary) combinatorics and by adding some topics on more refined (or secondary) combinatorics, including Dyck and Motzkin paths, Catalan, Narayana and Motzkin numbers and secondary structures coming from biology. Some log–convexity properties and asymptoti...
متن کاملTwo explicit formulas for the generalized Motzkin numbers
In the paper, by the Faà di Bruno formula, the authors establish two explicit formulas for the Motzkin numbers, the generalized Motzkin numbers, and the restricted hexagonal numbers.
متن کاملSeveral Explicit and Recursive Formulas for the Generalized Motzkin Numbers
In the paper, the authors find two explicit formulas and recover a recursive formula for the generalized Motzkin numbers. Consequently, the authors deduce two explicit formulas and a recursive formula for the Motzkin numbers, the Catalan numbers, and the restricted hexagonal numbers respectively.
متن کاملParametric Catalan Numbers and Catalan Triangles
Here presented a generalization of Catalan numbers and Catalan triangles associated with two parameters based on the sequence characterization of Bell-type Riordan arrays. Among the generalized Catalan numbers, a class of large generalized Catalan numbers and a class of small generalized Catalan numbers are defined, which can be considered as an extension of large Schröder numbers and small Sch...
متن کاملHilly poor noncrossing partitions and (2, 3)-Motzkin paths
A hilly poor noncrossing partition is a noncrossing partition with the properties : (1) each block has at most two elements, (2) in its linear representation, any isolated vertex is covered by some arc. This paper defines basic pairs as a combinatorial object and gives the number of hilly poor noncrossing partitions with n blocks, which is closely related to Maximal Davenport-Schinzel sequences...
متن کامل