Connecting \(k\)-Naples parking functions and obstructed parking functions via involutions
From MaRDI portal
Publication:2153403
DOI10.37236/10630zbMath1493.90043arXiv2012.02623OpenAlexW3111686460MaRDI QIDQ2153403
Publication date: 4 July 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.02623
Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Traffic problems in operations research (90B20)
Cites Work
- Unnamed Item
- A refinement of Cayley's formula for trees
- Counting defective parking functions
- Parking functions on directed graphs and some directed trees
- Mappings of acyclic and parking functions
- A generalization of parking functions allowing backward movement
- Counting k-Naples parking functions through permutations and the k-Naples area statistic
- Parking cars after a trailer
- An Occupancy Discipline and Applications
This page was built for publication: Connecting \(k\)-Naples parking functions and obstructed parking functions via involutions