Prefix exchanging and pattern avoidance by involutions (Q1408519)

The author considers the numbers \(I_n(\pi)\) of involutions in the symmetric group \(S_n\) which avoid the given permutation (or ``pattern'') \(\pi\). Two permutations \(\alpha\) and \(\beta\) in \(S_j\) are considered as ``prefixes'' which may be exchanged, if for all \(k\) and all permutations \(\tau\) of the set \(\{j+1,\dots,k\}\) the equation \(I_n(\alpha\,\tau)=I_n(\beta\,\tau)\) holds for all \(n\). The author shows that in this sense prefixes \(12\) and \(21\) as well as prefixes \(123\) and \(321\) may be exchanged. The method of proof involves ``placements'' in Ferrers diagrams.