Abstract

Abstract. Recently, Babson and Steingrímsson have introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We will 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. 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. We also give some results for the number of permutations avoiding two different patterns. These results relate the permutations in question to Motzkin paths, involutions and non-overlapping partitions. Furthermore, we define a new class of set partitions, called monotone partitions, and show that these partitions are in one-to-one correspondence with non-overlapping partitions. 1.

Citations

511	A Handbook of Integer Sequences - Sloane - 1973
206	The art of computer programming Vol. 1: Fundamental algorithms - Knuth - 1997
185	Restricted permutations - Simion, Schmidt - 1985
180	Enumerative combinatorics Vol - Stanley - 1999
108	The art of computer programming. Volume 1 - Knuth - 1997
97	Einar Steingrímsson, Generalized permutation patterns and a classification of the Mahonian statistics - Babson - 2000
89	Generating trees and the Catalan and Schröder numbers - West - 1995
39	Dyck path enumeration - Deutsch - 1999
12	Non–overlapping partitions, continued fractions, Bessel functions and a divergent series - Flajolet, Schott - 1990
10	personal communication - Kitaev - 1997
4	Un modèle combinatoire pour les polynômes de Bessel - Dulucq, Favreau - 1990