Strings of Length 3 in Grand-Dyck Paths and the Chung-Feller Property
This paper deals with the enumeration of Grand-Dyck paths according to the statistic "number of occurrences of $\tau$" for every string $\tau$ of length $3$, taking into account the number of flaws of the path. Consequently, some new refinements of the Chung-Feller theorem are obtained.
Gespeichert in:
| Veröffentlicht in: | The Electronic journal of combinatorics 2012-04, Vol.19 (2) |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | This paper deals with the enumeration of Grand-Dyck paths according to the statistic "number of occurrences of $\tau$" for every string $\tau$ of length $3$, taking into account the number of flaws of the path. Consequently, some new refinements of the Chung-Feller theorem are obtained. |
|---|---|
| ISSN: | 1077-8926 1077-8926 |
| DOI: | 10.37236/2181 |