Permutation invariant parking assortments
From MaRDI portal
Publication:6659969
DOI10.54550/ECA2024V4S1R4MaRDI QIDQ6659969FDOQ6659969
Authors: Douglas Chen, Pamela E. Harris, J. Carlos Martínez Mori, Eric Pabón-Cancel, Gabriel Sargent
Publication date: 9 January 2025
Published in: Enumerative Combinatorics and Applications (Search for Journal in Brave)
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Group actions on combinatorial structures (05E18)
Cites Work
- An Occupancy Discipline and Applications
- Parking functions
- A combinatorial model for computing volumes of flow polytopes
- Parking Cars of Different Sizes
- Counting k-Naples parking functions through permutations and the k-Naples area statistic
- Parking Functions: Choose Your Own Adventure
- The convex hull of parking functions of length n
- On increasing and invariant parking sequences
- Brussels sprouts, noncrossing trees, and parking functions
- On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
- Counting parking sequences and parking assortments through permutations
Cited In (2)
This page was built for publication: Permutation invariant parking assortments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659969)