The Internet Archive has a preservation copy of this work in our general collections.
The file type is
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 toarXiv:math/0011235v1 fatcat:zilhpaytb5ebbplz47ogoywglu