Refinements of Lattice paths with flaws

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Refinements of Lattice paths with flaws does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Refinements of Lattice paths with flaws, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Refinements of Lattice paths with flaws will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-349296

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.