2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/63679Define $S_n^k(T)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid all patterns in $T \subseteq S_m$. We enumerate $S_n^k(T)$, $T \subseteq S_3$, for all $|T| \geq 2$ and $0 \leq k \leq n$.Combinatorics05A15; 68R15text