AbstractWe prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1,2,…,n} is equal to the sum of weights of Motzkin paths of length n, where the weight of a Motzkin path is a product of certain fractions involving Fibonacci numbers. We provide two proofs of their conjecture: one uses continued fractions and the other is combinatorial
AbstractTwo equations relate the well-known Catalan numbers with the relatively unknown Motzkin numb...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractGiven a sequence of integers b=(b0,b1,b2,…) one gives a Dyck path P of length 2n the weightw...
AbstractWe prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
AbstractBased on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find...
AbstractIn this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Rece...
A bijective correspondence is established between secondary structures of a given rank and size and ...
AbstractNoncrossing linked partitions arise in the study of certain transforms in free probability t...
We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. The...
We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. The...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
A bijective correspondence is established between secondary structures of a given rank and size and ...
AbstractWe use combinatorial methods to evaluate Hankel determinants for the sequence of sums of con...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010.Cataloged from PD...
AbstractTwo equations relate the well-known Catalan numbers with the relatively unknown Motzkin numb...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractGiven a sequence of integers b=(b0,b1,b2,…) one gives a Dyck path P of length 2n the weightw...
AbstractWe prove a conjecture of Drake and Kim: the number of 2-distant noncrossing partitions of {1...
AbstractWe find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin...
AbstractBased on a weighted version of the bijection between Dyck paths and 2-Motzkin paths, we find...
AbstractIn this paper we study the number of humps (peaks) in Dyck, Motzkin and Schröder paths. Rece...
A bijective correspondence is established between secondary structures of a given rank and size and ...
AbstractNoncrossing linked partitions arise in the study of certain transforms in free probability t...
We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. The...
We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. The...
AbstractA new bijection between ordered trees and 2-Motzkin paths is presented, together with its nu...
A bijective correspondence is established between secondary structures of a given rank and size and ...
AbstractWe use combinatorial methods to evaluate Hankel determinants for the sequence of sums of con...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2010.Cataloged from PD...
AbstractTwo equations relate the well-known Catalan numbers with the relatively unknown Motzkin numb...
AbstractWe consider plane rooted trees onn+1 vertices without branching points on odd levels. The nu...
AbstractGiven a sequence of integers b=(b0,b1,b2,…) one gives a Dyck path P of length 2n the weightw...
DOI
Add to ORKG