Add to ORKGA bijective correspondence is established between secondary structures of a given rank and size and plane trees satisfying certain additional conditions. The correspondence is then used to obtain new combinatorial interpretations of Motzkin numbers in terms of plane trees and Dyck paths
A possible upgrade of a curriculum in undergraduate course in combinatorics is presented by giving m...
AbstractBased on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find...
AbstractA leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and ...
A bijective correspondence is established between secondary structures of a given rank and size and ...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractA secondary structure is a planar, labeled graph on the vertex set {1,…,n} having two kind o...
AbstractTwo equations relate the well-known Catalan numbers with the relatively unknown Motzkin numb...
AbstractSome new sequences are introduced which satisfy quadratic recurrence rules similar to those ...
AbstractFour equations are presented relating the well-known Catalan numbers and the Motzkin numbers...
We define sequences MTn and CTn of polynomials associated with Motzkin and Catalan paths, respective...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractIn this paper we introduce two new expansions for the generating functions of Catalan number...
AbstractIn this paper Motzkin numbersMn(which are related to Catalan numbers) are studied. The (know...
A possible upgrade of a curriculum in undergraduate course in combinatorics is presented by giving m...
AbstractBased on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find...
AbstractA leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and ...
A bijective correspondence is established between secondary structures of a given rank and size and ...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
AbstractA secondary structure is a planar, labeled graph on the vertex set {1,…,n} having two kind o...
AbstractTwo equations relate the well-known Catalan numbers with the relatively unknown Motzkin numb...
AbstractSome new sequences are introduced which satisfy quadratic recurrence rules similar to those ...
AbstractFour equations are presented relating the well-known Catalan numbers and the Motzkin numbers...
We define sequences MTn and CTn of polynomials associated with Motzkin and Catalan paths, respective...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractIn this paper we introduce two new expansions for the generating functions of Catalan number...
AbstractIn this paper Motzkin numbersMn(which are related to Catalan numbers) are studied. The (know...
A possible upgrade of a curriculum in undergraduate course in combinatorics is presented by giving m...
AbstractBased on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find...
AbstractA leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and ...