
arXiv: 1912.06930
Paths that consist of up-steps of one unit and down-steps of \(k\) units, being bounded below by a horizontal line \(-t\), behave like \(t+1\) ordered tuples of \(k\)-Dyck paths, provided that \(t\le k\). We describe the general case, allowing \(t\) also to be larger. Arguments are bijective and/or analytic.
\(k\)-Dyck paths, generating functions, Exact enumeration problems, generating functions, bijections, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Paths and cycles, Trees
\(k\)-Dyck paths, generating functions, Exact enumeration problems, generating functions, bijections, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Paths and cycles, Trees
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
