Classical pattern distributions in S_n(132) and S_n(123)

zbMATH Open1437.05013arXiv1810.10099MaRDI QIDQ5207834FDOQ5207834

Authors: Dun Qiu, Jeffrey Remmel 

Publication date: 13 January 2020

Abstract: Classical pattern avoidance and occurrence are well studied in the symmetric group $mathcal{S}_n$. In this paper, we provide explicit recurrence relations to the generating functions counting the number of classical pattern occurrence in the set of 132-avoiding permutations and the set of 123-avoiding permutations.

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

Recommendations

• Pattern popularity in 132-avoiding permutations
• Expected patterns in permutation classes
• Permutations with restricted patterns and Dyck paths
• The equidistribution of some length-three vincular patterns on \(S_n(132)\)
• scientific article

zbMATH Keywords

Catalan numbersDyck pathspermutation statisticsclassical patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19)

Cited In (11)

• Surprising symmetries in objects counted by Catalan numbers
• The 1-box pattern on pattern-avoiding permutations
• Equipopularity classes of 132-avoiding permutations
• Counting occurrences of 132 in a permutation
• On a recurrence related to 321 -- avoiding permutations
• Pattern popularity in 132-avoiding permutations
• Permutations, moments, measures
• The equidistribution of some length-three vincular patterns on \(S_n(132)\)
• Some equinumerous pattern-avoiding classes of permutations
• The combinatorics of Jeff Remmel
• Symmetric permutations avoiding two patterns

This page was built for publication: Classical pattern distributions in \(\mathcal{S}_n(132)\) and \(\mathcal{S}_n(123)\)

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