  Given a Stirling permutation w, we introduce the mesa set of w as the natural
generalization of the pinnacle set of a permutation. Our main results
characterize admissible mesa sets and give closed enumerative formulas in terms
of rational Catalan numbers by providing an explicit bijection between mesa
sets and rational Dyck paths.

Combinatorics