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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call