1 problem

A pattern $q$ of length $k$ is a permutation pattern, and let $S_n(q)$ denote the number of permutations of length $n$ avoiding $q$. Define its Stanley–Wilf limit by … A pattern is…