Enumerating k-Naples Parking Functions Through Catalan Objects

MaRDI QIDQ6376819zbMATH OpenFDO

Authors J. P. Carvalho, Pamela E. Harris, Gordon Rojas Kirby, Nico Tripeny, Andrés R. Vindas Meléndez

Publication date 3 September 2021

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Abstract: This paper studies a generalization of parking functions named $k$-Naples parking functions, where backward movement is allowed. One consequence of backward movement is that the number of ascending $k$-Naples is not the same as the number of descending $k$-Naples. This paper focuses on generalizing the bijections of ascending parking functions with combinatorial objects enumerated by the Catalan numbers in the setting of both ascending and descending $k$-Naples parking functions. These combinatorial objects include Dyck paths, binary trees, triangulations of polygons, and non-crossing partitions. Using these bijections, we enumerate both ascending and descending $k$-Naples parking functions.

This page was built for publication: Enumerating $k$-Naples Parking Functions Through Catalan Objects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6376819)