2015
DOI: 10.37236/3941
|View full text |Cite
|
Sign up to set email alerts
|

Some Enumerations on Non-Decreasing Dyck Paths

Abstract: We construct a formal power series on several variables that encodes many statistics on non-decreasing Dyck paths. In particular, we use this formal power series to count peaks, pyramid weights, and indexed sums of pyramid weights for all non-decreasing Dyck paths of length $2n.$ We also show that an indexed sum on pyramid weights depends only on the size and maximum element of the indexing set.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

1
15
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 20 publications
(16 citation statements)
references
References 8 publications
1
15
0
Order By: Relevance
“…A Dyck path is called non-decreasing if the heights of its valleys form a non-decreasing sequence from left to right (see Figure 1 for an example). Non-decreasing Dyck paths have been extensively studied in the literature, see [2,5,6,8,14,16,17,20]. All the Dyck paths considered in this paper will be non-decreasing.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…A Dyck path is called non-decreasing if the heights of its valleys form a non-decreasing sequence from left to right (see Figure 1 for an example). Non-decreasing Dyck paths have been extensively studied in the literature, see [2,5,6,8,14,16,17,20]. All the Dyck paths considered in this paper will be non-decreasing.…”
Section: Introductionmentioning
confidence: 99%
“…All the Dyck paths considered in this paper will be non-decreasing. Following the notation from [5,6,13,14], we denote by D the set of all non-decreasing Dyck paths, and by D n the set of all non-decreasing Dyck paths of length 2n, where the length is defined as the number of steps. For P ∈ D n , we write |P |= n to denote its semilength.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In 1997 Barcucci et al [2] introduced the concept of non-decreasing Dyck paths, and since then many papers, studying several aspects of this family of paths, have appeared [2,3,[6][7][8][9][10][11][12][13]19]. A t-Dyck path is a generalization of the Dyck path concept where every South-East step has length of ðt À 1Þ.…”
Section: Introductionmentioning
confidence: 99%
“…length, number of peaks, valleys, double rises and other pattern occurrences [9,14,15,17,18,19,20,23]. Restricted classes of Dyck paths have also been considered, for instance Barcucci et al [1] consider Dyck paths having a non-decreasing height sequence of valleys (see also [7,8]). Other papers deal with Motzkin paths using similar methods [2,5,10,11,16,21,24].…”
Section: Introduction and Notationmentioning
confidence: 99%