Permutation invariant parking assortments

DOI10.54550/ECA2024V4S1R4MaRDI QIDQ6659969zbMATH OpenFDO

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)

zbMATH Keywords

permutation invarianceparking functionsparking sequences

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Group actions on combinatorial structures (05E18)

Recommendations

• Counting parking sequences and parking assortments through permutations
• On increasing and invariant parking sequences
• Subset parking functions
• Probabilizing parking functions
• Parking functions: interdisciplinary connections

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)

• Counting parking sequences and parking assortments through permutations
• On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths

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)