Enumerating permutations avoiding a pair of Babson-Steingrimsson patterns

Details Enumerating permutations avoiding a pair of Babson-Steingrimsson patterns Enumerating permutations avoiding a pair of Babson-Steingrimsson patterns

2001-07-06

arxiv.org/abs/math/0107044v5

Mathematics

Combinatorics

Scientific paper

Babson and Steingr\`imsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Subsequently, Claesson presented a complete solution for the number of permutations avoiding any single pattern of type (1,2) or (2,1). For eight of these twelve patterns the answer is given by the Bell numbers. For the remaining four the answer is given by the Catalan numbers. In the present paper we give a complete solution for the number of permutations avoiding a pair of patterns of type (1,2) or (2,1). We also conjecture the number of permutations avoiding the patterns in any set of three or more such patterns.

Affiliated with

Also associated with

No associations

Rating

Enumerating permutations avoiding a pair of Babson-Steingrimsson patterns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumerating permutations avoiding a pair of Babson-Steingrimsson patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating permutations avoiding a pair of Babson-Steingrimsson patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-361399