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

DOI10.54550/ECA2021V1S2R11zbMath1499.05030arXiv2009.01124MaRDI QIDQ5056201

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

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)

Related Items

Connecting \(k\)-Naples parking functions and obstructed parking functions via involutions

Uses Software

• SageMath
• FindStat

Cites Work

• Unnamed Item
• \(G\)-parking functions, acyclic orientations and spanning trees
• Parking functions and noncrossing partitions
• A polytope related to empirical distributions, plane trees, parking functions, and the associahedron
• Combinatorics of \(q\), \(t\)-parking functions
• Enumerating parking completions using join and split
• A generalization of parking functions allowing backward movement
• The Supremum and Infimum of the Poisson Process
• Hyperplane arrangements, interval orders, and trees.
• Handbook of Enumerative Combinatorics
• On an enumeration problem
• An Occupancy Discipline and Applications