Pattern avoidance in parking functions
From MaRDI portal
Recommendations
Cites work
- A remarkable \(q,t\)-Catalan sequence and \(q\)-Lagrange inversion
- An Occupancy Discipline and Applications
- Chords, trees and permutations
- Combinatorics of permutations
- Hopf algebras of \(m\)-permutations, \((m + 1)\)-ary trees, and \(m\)-parking functions
- Kernel method and linear recurrence system
- Patterns in permutations and words.
- Patterns in words of ordered set partitions
- Protected points in ordered trees
- Relations between hypersurface cross ratios, and a combinatorial formula for partitions of a polygon, for permanent preponderance, and for non-associative products
- Restricted permutations
- The q,t-Catalan numbers and the space of diagonal harmonics. With an appendix on the combinatorics of Macdonald polynomials
- The Supremum and Infimum of the Poisson Process
- Wilf-equivalence on \(k\)-ary words, compositions, and parking functions
Cited in
(7)- On the outcome map of MVP parking functions: permutations avoiding 321 and 3412, and Motzkin paths
- Counting parking sequences and parking assortments through permutations
- Interval and -interval rational parking functions
- Lattice paths enumerations weighted by ascent lengths
- Fixed points and cycles of parking functions
- Results on pattern avoidance in parking functions
- The defective parking space and defective Kreweras numbers
This page was built for publication: Pattern avoidance in parking functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659956)