Partial permutations avoiding pairs of patterns

DOI10.1016/j.disc.2013.08.004zbMath1281.05003OpenAlexW2060852067MaRDI QIDQ393932

Noah Arbesfeld

Publication date: 24 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.004

zbMATH Keywords

pattern avoidancepartial permutationsWilf-equivalence

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Combinatorial aspects of representation theory (05E10)

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Shape-Wilf-equivalences for vincular patterns
• Pattern avoidance in partial permutations
• Forbidden subsequences
• Finite transition matrices for permutations avoiding pairs of length four patterns
• A new class of Wilf-equivalent permutations
• Generating trees and the Catalan and Schröder numbers
• Generating trees and forbidden subsequences
• Pattern avoidance in matchings and partitions
• Permutations with forbidden subsequences and a generalized Schröder number
• Wilf classes of pairs of permutations of length 4
• Wilf-equivalence for singleton classes
• Restricted permutations
• Restricted permutations

This page was built for publication: Partial permutations avoiding pairs of patterns