Generating-Tree Isomorphisms for Pattern-Avoiding Involutions
Annals of Combinatorics, pp. 1-12, 2011.
05A0505A15permutation patterninvolutiongenerating tree
We show that for k ≥ 5 and the permutations τ k = (k − 1)k(k − 2). . .312 and J k = k(k − 1). . .21, the generating tree for involutions avoiding the pattern τ k is isomorphic to the generating tree for involutions avoiding the pattern J k . This implies a family of Wilf equivalences for pattern avoidance by involutions...More
Full Text (Upload PDF)
PPT (Upload PPT)