Dyck paths, standard Young tableaux, and pattern avoiding permutations

MaRDI QIDQ2915608zbMATH OpenFDO

Authors Hilmar Haukur Gudmundsson

Publication date 18 September 2012

Published in PU.M.A. Pure Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0912.4747

zbMATH Keywords

Catalan numberslattice pathspattern avoidancepermutation statisticsstandard Young tableaux

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Abstract: We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of another pattern of length three. This gives a refinement of some previously studied statistics, most notably one by Noonan. The formula is also shown to enumerate a family of classes of Dyck paths and Standard Young Tableaux, and a bijection is given between the corresponding classes of these two families of objects. Finally, the results obtained are used to solve an optimization problem for a certain card game.

Recommendations

• Permutations with restricted patterns and Dyck paths
• How to decompose a permutation into a pair of labeled Dyck paths by playing a game
• Dyck paths and restricted permutations
• From Dyck paths to standard Young tableaux
• A simple and unusual bijection for Dyck paths and its consequences

Cited in

(4)

• From Dyck paths to standard Young tableaux
• Pattern avoidance for alternating permutations and Young tableaux
• Enumeration of partial Łukasiewicz paths
• Dyck paths and pattern-avoiding matchings

This page was built for publication: Dyck paths, standard Young tableaux, and pattern avoiding permutations

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