Generalized Pattern Avoidance
โ
Anders Claesson
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 285 KB
Recently, Babson and Steingrรญmsson have introduced generalized 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