| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4647361 | Discrete Mathematics | 2014 | 9 Pages |
Abstract
A peak in a Dyck path is called nonleft, if the ascent preceding it is greater than or equal to the descent following it. In this paper, we present a combinatorial construction of the set of Dyck paths of fixed semilength and number of nonleft peaks. As a bonus, we obtain various results on the enumeration of several kinds of peaks.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
K. Manes, A. Sapounakis, I. Tasoulas, P. Tsikouras,