Counting k-Naples parking functions through permutations and the k-Naples area statistic

DOI10.54550/ECA2021V1S2R11MaRDI QIDQ5056201zbMATH OpenFDO

Authors Laura Colmenarejo, Pamela E. Harris, Zakiya Jones, Christo Keller, Andrés Ramos Rodríguez, Eunice Sukarto, Andrés R. Vindas Meléndez

Publication date 7 December 2022

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.01124

zbMATH Keywords

permutationsgenerating functionsarea statistic\(q\)-analogs\(k\)-Naples parking functions

Mathematics Subject Classification ID

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

Abstract: We recall that the $k$-Naples parking functions of length $n$ (a generalization of parking functions) are defined by requiring that a car which finds its preferred spot occupied must first back up a spot at a time (up to $k$ spots) before proceeding forward down the street. Note that the parking functions are the specialization of $k$ to $0$. For a fixed $0leqkleqn-1$, we define a function $varph{i}_k$ which maps a $k$-Naples parking function to the permutation denoting the order in which its cars park. By enumerating the sizes of the fibers of the map $varph{i}_k$ we give a new formula for the number of $k$-Naples parking functions as a sum over the permutations of length $n$. We remark that our formula for enumerating $k$-Naples parking functions is not recursive, in contrast to the previously known formula of Christensen et al [CHJ+20]. It can be expressed as the product of the lengths of particular subsequences of permutations, and its specialization to $k=0$ gives a new way to describe the number of parking functions of length $n$. We give a formula for the sizes of the fibers of the map $varph{i}_0$, and we provide a recurrence relation for its corresponding logarithmic generating function. Furthermore, we relate the $q$-analog of our formula to a new statistic that we denote $exttt{area}_k$ and call the $k$-Naples area statistic, the specialization of which to $k=0$ gives the $extttarea$ statistic on parking functions.

Recommendations

• A generalization of parking functions allowing backward movement
• Connecting k-Naples parking functions and obstructed parking functions via involutions
• Some aspects of (r,k)-parking functions
• Subset parking functions
• Descents in parking functions

Cites work

• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• A generalization of parking functions allowing backward movement
• A polytope related to empirical distributions, plane trees, parking functions, and the associahedron
• An Occupancy Discipline and Applications
• Combinatorics of \(q\), \(t\)-parking functions
• Enumerating parking completions using join and split
• Handbook of Enumerative Combinatorics
• Hyperplane arrangements, interval orders, and trees.
• On an enumeration problem
• Parking functions and noncrossing partitions
• The Supremum and Infimum of the Poisson Process
• \(G\)-parking functions, acyclic orientations and spanning trees

Cited in

(7)

• On the lucky and displacement statistics of Stirling permutations
• Connecting k-Naples parking functions and obstructed parking functions via involutions
• A generalization of parking functions allowing backward movement
• On friendship and cyclic parking functions
• Counting parking sequences and parking assortments through permutations
• On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
• Permutation invariant parking assortments

Describes a project that uses

Uses Software

• FindStat
• SageMath

This page was built for publication: Counting k-Naples parking functions through permutations and the k-Naples area statistic

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