Refinements of (\(n,m\))-Dyck paths
type: Item
instance of: scholarly article
title: Refinements of (\(n,m\))-Dyck paths
zbMATH Open document ID: 1201.05008
author: Jun Ma
author: Yeong-Nan Yeh
published in: European Journal of Combinatorics
publication date: 2010-11-22T00:00:00Z
review text: A \((n,m)\)-Dyck path is a lattice path in \(\mathbb{Z}\times\mathbb{Z}\) using up \((1,1)\) and down \((1,-1)\) steps that go from the origin to the point \((2n,0)\) and it contains exactly \(m\) up steps under the \(x\)-axis. The classical Chung-Feller theorem tells us that the number of \((n,m)\)-Dyck paths is \(\frac{1}{n+1}\binom{2n}{n}\) the \(n\)-th Catalan number. In this paper, the authors considered refinements of \((n,m)\)-Dyck paths by using four parameters: peaks, valleys, double-descents and double-ascents. In particular, they showed that the number of \((n,m)\)-Dyck paths having exactly \(k\)-peaks is given by \(\frac{2(n+2)}{n(n-1)}\binom{n}{k-1}\binom{n}{k}\) for all \(m=1,2,\ldots,n-1\) and independent of \(m\). Moreover, they found that the number of \((n,m)\)-Dyck paths having exactly \(k\) double-ascents (double-descents) is given by \(\frac{1}{k+1}\binom{n-1}{k}\binom{n}{k}\).
reviewed by: Toufik Mansour
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 5817921
zbMATH Keywords: Dyck paths
zbMATH Keywords: peaks
zbMATH Keywords: valleys
zbMATH Keywords: double-descents
zbMATH Keywords: double-ascents
MaRDI profile type: Publication
full work available at URL: j.ejc.2010.07.005
OpenAlex ID: W1492470654
cites work: The Chung-Feller theorem revisited
cites work: On Fluctuations in Coin-Tossing
cites work: Refined Chung-Feller theorems for lattice paths
cites work: Taylor expansions for Catalan and Motzkin numbers
cites work: Chung-Feller property in view of generating functions
cites work: Q5538192
cites work: Q4344108
DOI: 10.1016/J.EJC.2010.07.005
description: scientific article; zbMATH DE number 5817921