Strings of length 3 in grand-Dyck paths and the Chung-Feller property (Q426856): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Summary: 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. | |||
Property / review text: Summary: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05A19 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6045695 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
grand-Dyck path | |||
Property / zbMATH Keywords: grand-Dyck path / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Dyck path | |||
Property / zbMATH Keywords: Dyck path / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Chung-Feller theorem | |||
Property / zbMATH Keywords: Chung-Feller theorem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
string | |||
Property / zbMATH Keywords: string / rank | |||
Normal rank |
Revision as of 22:58, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strings of length 3 in grand-Dyck paths and the Chung-Feller property |
scientific article |
Statements
Strings of length 3 in grand-Dyck paths and the Chung-Feller property (English)
0 references
12 June 2012
0 references
Summary: 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.
0 references
grand-Dyck path
0 references
Dyck path
0 references
Chung-Feller theorem
0 references
string
0 references