Pattern Avoidance by Even Permutations

  • Andrew Baxter
  • Aaron D. Jaggard

Abstract

We study questions of even-Wilf-equivalence, the analogue of Wilf-equivalence when attention is restricted to pattern avoidance by permutations in the alternating group. Although some Wilf-equivalence results break when considering even-Wilf-equivalence analogues, we prove that other Wilf-equivalence results continue to hold in the even-Wilf-equivalence setting. In particular, we prove that $t(t-1)\cdots 321$ and $(t-1)(t-2)\cdots 21t$ are even-shape-Wilf-equivalent for odd $t$, paralleling a result (which held for all $t$) of Backelin, West, and Xin for shape-Wilf-equivalence. This allows us to classify the symmetric group $\mathcal{S}_{4}$, and to partially classify $\mathcal{S}_{5}$ and $\mathcal{S}_{6}$, according to even-Wilf-equivalence. As with transition to involution-Wilf-equivalence, some—but not all—of the classical Wilf-equivalence results are preserved when we make the transition to even-Wilf-equivalence.

Published
2011-12-19