Avoiding Paired Colored Patterns in Length Three

Abstract

This project studies pattern avoidance in colored permutations (S_n\wr C_r) using the pattern matching condition developed by Toufik Mansour. He proved results in enumeration of avoidance classes of patterns of length two. We have taken the next step and proved results in the enumeration of avoidance classes of paired patterns of length three.