Generalised Pattern Avoidance

Details Generalised Pattern Avoidance Generalised Pattern Avoidance

2000-11-28

arxiv.org/abs/math/0011235v1

Mathematics

Combinatorics

Scientific paper

Recently, Babson and Steingrimsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider pattern avoidance for such patterns, and give a complete solution for the number of permutations avoiding any single pattern of length three with exactly one adjacent pair of letters. We also give some results for the number of permutations avoiding two different patterns. Relations are exhibited to several well studied combinatorial structures, such as set partitions, Dyck paths, Motzkin paths, and involutions. Furthermore, a new class of set partitions, called monotone partitions, is defined and shown to be in one-to-one correspondence with non-overlapping partitions.

Affiliated with

Also associated with

No associations

Rating

Generalised Pattern Avoidance 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 Generalised Pattern Avoidance, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalised Pattern Avoidance will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-115190