Abstract
There are several versions of permutation pattern avoidance that have arisen in the literature, and some known examples of two different types of pattern avoidance coinciding. In this paper, we examine barred patterns and vincular patterns. Answering a question of Steingrimsson, we determine when barred pattern avoidance coincides with avoiding a finite set of vincular patterns, and when vincular pattern avoidance coincides with avoiding a finite set of barred patterns. There are 720 barred patterns with this property, each having between 3 and 7 letters, of which at most 2 are barred, and there are 48 vincular patterns with this property, each having between 2 and 4 letters and exactly one bond.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
