Pattern avoidance in permutations and their squares

2018/12/31 by Bona, Miklos, Smith, Rebecca · 1 citation
#05A05 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1901.00026

Abstract

We study permutations p such that both p and p² avoid a given pattern q. We obtain a generating function for the case of q=312 (equivalently, q=231), we prove that if q is monotone increasing, then above a certain length, there are no such permutations, and we prove an upper bound for q=321. We also present some intriguing questions in the case of q=132.

Cited by

• Pattern avoidance in compositions and powers of permutations

Related

• On the permutations that strongly avoid the pattern 312 or 231
• Pattern avoidance in compositions and powers of permutations
• On the Best Upper Bound for Permutations Avoiding A Pattern of a Given Length
• Powers of permutations that avoid chains of patterns
• Where the monotone pattern (mostly) rules