Pattern avoidance in double lists

Abstract

We consider pattern avoidance in a subset of words on $\left\{1,1,2,2,\dots ,n,n\right\}$ called double lists. We enumerate double lists avoiding any permutation pattern of length at most 4 and completely determine the corresponding Wilf classes.