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

DOI10.54550/ECA2023V3S2R11MaRDI QIDQ6659948FDOQ6659948

Authors: Pamela E. Harris, Brian M. Kamau, J. Carlos Martínez Mori, Roger Tian 

Publication date: 9 January 2025

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

Recommendations

• Counting parking sequences and parking assortments through permutations
• Pattern avoidance in parking functions
• Permutation invariant parking assortments
• A generalization of parking functions allowing backward movement

zbMATH Keywords

permutation pattern avoidanceMotzkin pathsMVP parking functions

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• An Occupancy Discipline and Applications
• Parking functions
• Catalan Numbers
• Schubert varieties and short braidedness
• Pattern avoidance and the Bruhat order.
• Motzkin numbers
• Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
• Generating trees and forbidden subsequences
• Title not available (Why is that?)
• On Schubert varieties of complexity one
• Counting k-Naples parking functions through permutations and the k-Naples area statistic

Cited In (3)

• On friendship and cyclic parking functions
• Counting parking sequences and parking assortments through permutations
• Permutation invariant parking assortments

This page was built for publication: On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths

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