Some enumerations on non-decreasing Dyck paths (Q490298)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some enumerations on non-decreasing Dyck paths |
scientific article; zbMATH DE number 6389242
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some enumerations on non-decreasing Dyck paths |
scientific article; zbMATH DE number 6389242 |
Statements
Some enumerations on non-decreasing Dyck paths (English)
0 references
22 January 2015
0 references
Summary: 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.
0 references
generating functions
0 references
non-decreasing Dyck paths
0 references
path weight
0 references
valley
0 references
pyramid
0 references
Fibonacci numbers
0 references
0.9768691
0 references
0 references
0.9366791
0 references
0.9352364
0 references
0.92377687
0 references
0.9089387
0 references
0 references
0.9059704
0 references
0.90512705
0 references
