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

DOI10.54550/ECA2023V3S2R11MaRDI QIDQ6659948

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

Publication date: 9 January 2025

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

zbMATH Keywords

Motzkin pathspermutation pattern avoidanceMVP parking functions

Mathematics Subject Classification ID

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

Cites Work

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

Related Items (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)