The statistic ``number of udu's'' in Dyck paths (Q1886363): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q169304 |
||
| Property / reviewed by | |||
| Property / reviewed by: László A. Székely / rank | |||
Revision as of 02:39, 10 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The statistic ``number of udu's'' in Dyck paths |
scientific article |
Statements
The statistic ``number of udu's'' in Dyck paths (English)
0 references
18 November 2004
0 references
This paper studies the enumeration of Dyck paths by the number of \(udu\)'s (up-down-up). More precisely, the enumeration of Dyck paths with given semilength and given number of \(udu\)'s is obtained. An \(udu\) is said to be at low (high) level, if its peak is at level (greater than) one. Enumeration of Dyck paths with given semilength and given number of low (high) level \(udu\)'s is obtained.
0 references
Dyck paths
0 references
Motzkin numbers
0 references
combinatorial identities
0 references
enumeration
0 references
