Pattern matching in (213,231)-avoiding permutations

2015/11/05 by Both Emerite Neou, Neou, Both Emerite, Romeo Rizzi +3
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Coding theory and cryptography #Combinatorics #Combinatorics (math.CO) #Computer science #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics #Matching (statistics) #Mathematics #Permutation (music) #Physics #Statistics #cs.DS #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1511.01770

published in arXiv (Cornell University) (Cornell University)

arxiv created 2015/11/05 · arxiv updated 2015/11/06

Abstract

Given permutations σ∈ S_k and π∈ S_n with k

Related

• On the permutations that strongly avoid the pattern 312 or 231
• Pattern avoidance in compositions and powers of permutations
• Pattern-Avoiding Permutation Powers
• Permutations avoiding a set of patterns from S₃ and a pattern from S₄
• Pattern avoidance in permutations and their squares