Permutation invariant parking assortments
From MaRDI portal
Publication:6659969
Recommendations
Cites work
- A combinatorial model for computing volumes of flow polytopes
- An Occupancy Discipline and Applications
- Brussels sprouts, noncrossing trees, and parking functions
- Counting k-Naples parking functions through permutations and the k-Naples area statistic
- Counting parking sequences and parking assortments through permutations
- On increasing and invariant parking sequences
- On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
- Parking Cars of Different Sizes
- Parking Functions: Choose Your Own Adventure
- Parking functions
- The convex hull of parking functions of length n
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)