DM
2000
14 years 13 days ago
2000
For every integer j
JCT
2007
14 years 15 days ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
JCT
2007
14 years 15 days ago
2007
We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its p...
CORR
2010
Springer
14 years 22 days ago
2010
Springer
A coding method using binary sequences is presented for different computation problems related to Catalan numbers. This method proves in a very easy way the equivalence of these pr...