On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
From MaRDI portal
Publication:6659948
Recommendations
Cites work
- scientific article; zbMATH DE number 3156373 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- An Occupancy Discipline and Applications
- Catalan Numbers
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Counting k-Naples parking functions through permutations and the k-Naples area statistic
- Generating trees and forbidden subsequences
- Motzkin numbers
- On Schubert varieties of complexity one
- Parking functions
- Pattern avoidance and the Bruhat order.
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Schubert varieties and short braidedness
Cited in
(3)
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)