The Electronic Journal of Combinatorics · 2012 · 11 citations · 18 references
Natural SciencesMathematicsCombinatoricsDiscrete MathematicsCombinatorial EnumerationCombinatorial Number TheoryCombinatorial Set TheoryEnumerative CombinatoricsProbabilistic CombinatoricsString TheoryDyck PathsPath Enumeration
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.
18
Emeric Deutsch · Discrete Mathematics · 1999 · 277 citations
On Fluctuations in Coin-Tossing
Kai Lai Chung, William Feller · Proceedings of the National Academy of Sciences · 1949 · 132 citations · Full text
Counting strings in Dyck paths
A. Sapounakis, I. Tasoulas, P. Tsikouras · Discrete Mathematics · 2007 · 67 citations
A bijection on Dyck paths and its consequences
Emeric Deutsch · Discrete Mathematics · 1998 · 56 citations · Full text
The statistic “number of udu's” in Dyck paths
Yidong Sun · Discrete Mathematics · 2004 · 52 citations