Alternating, Pattern-Avoiding Permutations
Published in The Electronic Journal of Combinatorics • Feb 27, 2009
NobleIDNI9P75W14R35S84
Authors:
Joel Brewster Lewis
Abstract
We study the problem of counting alternating permutations avoiding collections of permutation patterns including $132$. We construct a bijection between the set $S_n(132)$ of $132$-avoiding permutations and the set $A_{2n + 1}(132)$ of alternating, $132$-avoiding permutations. For every set $p_1, \l...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!