On Wilf Equivalence for Alternating Permutations
نویسنده
چکیده
In this paper, we obtain several new classes of Wilf-equivalent patterns for alternating permutations. In particular, we prove that for any nonempty pattern τ , the patterns 12 . . . k ⊕ τ and k . . . 21 ⊕ τ are Wilf-equivalent for alternating permutations, paralleling a result of Backelin, West, and Xin for Wilf-equivalence for
منابع مشابه
Ascent-Descent Young Diagrams and Pattern Avoidance in Alternating Permutations
We investigate pattern avoidance in alternating permutations and an alternating analogue of Young diagrams. In particular, using an extension of Babson and West’s notion of shape-Wilf equivalence described in our recent paper (with N. Gowravaram), we generalize results of Backelin, West, and Xin and Ouchterlony to alternating permutations. Unlike Ouchterlony and Bóna’s bijections, our bijection...
متن کاملOn pattern avoiding alternating permutations
An alternating permutation of length n is a permutation π = π1π2 · · ·πn such that π1 < π2 > π3 < π4 > · · · . Let An denote the set of alternating permutations of {1, 2, . . . , n}, and let An(σ) be the set of alternating permutations in An that avoid a pattern σ. Recently, Lewis used generating trees to enumerate A2n(1234), A2n(2143) and A2n+1(2143), and he posed some conjectures on the Wilf-...
متن کاملBeyond Alternating Permutations: Pattern Avoidance in Young Diagrams and Tableaux
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West’s notion of shape-Wilf equivalence to apply to alternating permutations and so generalize results of Backelin-West-Xin and Ouchterlony to alternating permutations. Second, we study pattern a...
متن کاملOn a Refinement of Wilf-equivalence for Permutations
Recently, Dokos et al. conjectured that for all k,m > 1, the patterns 12 . . . k(k+ m+ 1) . . . (k + 2)(k + 1) and (m+ 1)(m+ 2) . . . (k +m+ 1)m. . . 21 are maj-Wilfequivalent. In this paper, we confirm this conjecture for all k > 1 and m = 1. In fact, we construct a descent set preserving bijection between 12 . . . k(k−1)-avoiding permutations and 23 . . . k1-avoiding permutations for all k > ...
متن کاملAvoiding Patterns of Length Three in Compositions and Multiset Permutations
We find generating functions for the number of compositions avoiding a single pattern or a pair of patterns of length three on the alphabet {1, 2} and determine which of them are Wilf-equivalent on compositions. We also derive the number of permutations of a multiset which avoid these same patterns and determine the Wilf-equivalence of these patterns on permutations of multisets. 2000 Mathemati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013