arXiv Analytics

Sign in

arXiv:0812.2820 [math.CO]AbstractReferencesReviewsResources

Refinements of Lattice paths with flaws

Jun Ma, Yeong-Nan Yeh

Published 2008-12-15Version 1

The classical Chung-Feller theorem [2] tells us that the number of Dyck paths of length $n$ with $m$ flaws is the $n$-th Catalan number and independent on $m$. In this paper, we consider the refinements of Dyck paths with flaws by four parameters, namely peak, valley, double descent and double ascent. Let ${p}_{n,m,k}$ be the number of all the Dyck paths of semi-length $n$ with $m$ flaws and $k$ peaks. First, we derive the reciprocity theorem for the polynomial $P_{n,m}(x)=\sum\limits_{k=1}^np_{n,m,k}x^k$. Then we find the Chung-Feller properties for the sum of $p_{n,m,k}$ and $p_{n,m,n-k}$. Finally, we provide a Chung-Feller type theorem for Dyck paths of length $n$ with $k$ double ascents: the number of all the Dyck paths of semi-length $n$ with $m$ flaws and $k$ double ascents is equal to the number of all the Dyck paths that have semi-length $n$, $k$ double ascents and never pass below the x-axis, which is counted by the Narayana number. Let ${v}_{n,m,k}$ (resp. $d_{n,m,k}$) be the number of all the Dyck paths of semi-length $n$ with $m$ flaws and $k$ valleys (resp. double descents). Some similar results are derived.

Related articles: Most relevant | Search more
arXiv:1705.05984 [math.CO] (Published 2017-05-17)
A bijection between bargraphs and Dyck paths
arXiv:math/0411427 [math.CO] (Published 2004-11-19)
Lattices of lattice paths
arXiv:1010.5673 [math.CO] (Published 2010-10-27)
Exterior Pairs and Up Step Statistics on Dyck Paths