Counting parking sequences and parking assortments through permutations

DOI10.54550/ECA2024V4S1R2MaRDI QIDQ6659967zbMATH OpenFDO

Authors Spencer J. Franks, Pamela E. Harris, Kimberly J. Harry, Jan Kretschmann, Megan Vance

Publication date 9 January 2025

Published in Enumerative Combinatorics and Applications (Search for Journal in Brave)

zbMATH Keywords

permutationsparking functionsparking assortmentsparking sequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Recommendations

• Permutation invariant parking assortments
• On increasing and invariant parking sequences
• Descents in parking functions
• Probabilizing parking functions

Cites work

• Ballots and trees
• Counting k-Naples parking functions through permutations and the k-Naples area statistic
• On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
• Parking Cars of Different Sizes
• Pattern avoidance in parking functions
• The convex hull of parking functions of length n

Cited in

(2)

• On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
• Permutation invariant parking assortments

This page was built for publication: Counting parking sequences and parking assortments through permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659967)