Uniquely-Wilf classes

Abstract

Two permutations in a class are Wilf-equivalent if, for every size, $n$, the number of permutations in the class of size $n$ containing each of them is the same. Those infinite classes that have only one equivalence class in each size for this relation are characterised provided either that they avoid at least one permutation of size 3, or at least three permutations of size 4.

Keywords

• mathematics - combinatorics
• computer science - discrete mathematics
• 05a05, 05a15, 05-04