Results on pattern avoidance in parking functions

DOI10.54550/ECA2025V5S1R2MaRDI QIDQ7034016zbMATH OpenFDO

Authors Jun Yan

Publication date 1 February 2025

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

Full work available at URL https://doi.org/10.54550/ECA2025V5S1R2

zbMATH Keywords

bijective proofsgenerating functionsparking functionspattern avoidance

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Cites work

• A remarkable \(q,t\)-Catalan sequence and \(q\)-Lagrange inversion
• Brussels sprouts, noncrossing trees, and parking functions
• Counting k-Naples parking functions through permutations and the k-Naples area statistic
• Hopf algebras of \(m\)-permutations, \((m + 1)\)-ary trees, and \(m\)-parking functions
• scientific article; zbMATH DE number 2123132 (Why is no real title available?)
• Pattern avoidance in parking functions
• Patterns in words of ordered set partitions
• Permutations with restricted patterns and Dyck paths
• The m-Schröder paths and m-Schröder numbers
• Wilf-equivalence on \(k\)-ary words, compositions, and parking functions

Cited in

(2)

• Lattice paths enumerations weighted by ascent lengths
• Fixed points and cycles of parking functions

This page was built for publication: Results on pattern avoidance in parking functions

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