Pattern avoiding alternating involutions
نویسندگان
چکیده
We enumerate and characterize some classes of alternating reverse involutions avoiding a single pattern length three or four. If on one hand the case patterns is trivial, other hand, four more challenging involves sequences combinatorial interest, such as Motzkin Fibonacci numbers.
منابع مشابه
Alternating, Pattern-Avoiding Permutations
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set Sn(132) of 132-avoiding permutations and the set A2n+1(132) of alternating, 132avoiding permutations. For every set p1, . . . , pk of patterns and certain related patterns q1, . . . , qk, our bijection restricts to a bijection between Sn(...
متن کاملPattern-avoiding alternating words
Abstract. A word w = w1w2 · · ·wn is alternating if either w1 < w2 > w3 < w4 > · · · (when the word is up-down) or w1 > w2 < w3 > w4 < · · · (when the word is down-up). In this paper, we initiate the study of (pattern-avoiding) alternating words. We enumerate up-down (equivalently, down-up) words via finding a bijection with order ideals of a certain poset. Further, we show that the number of 1...
متن کاملPattern-avoiding involutions: exact and asymptotic enumeration
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. We directly enumerate the involutions avoiding 1342 and the involutions avoiding 2341. As we demonstrate, the numerical data for these problems exhibits some surprising behavior. This strange behavior even provides some very unexpected data related to the...
متن کاملNew Equivalences for Pattern Avoiding Involutions
We complete the Wilf classification of signed patterns of length 5 for both signed permutations and signed involutions. New general equivalences of patterns are given which prove Jaggard’s conjectures concerning involutions in the symmetric group avoiding certain patterns of length 5 and 6. In this way, we also complete the Wilf classification of S5, S6, and S7 for involutions.
متن کاملGenerating-tree isomorphisms for pattern-avoiding involutions∗
We show that for k ≥ 5 and the permutations τk = (k − 1)k(k − 2) . . . 312 and Jk = k(k − 1) . . . 21, the generating tree for involutions avoiding the pattern τk is isomorphic to the generating tree for involutions avoiding the pattern Jk. This implies a family of Wilf equivalences for pattern avoidance by involutions; at least the first member of this family cannot follow from any type of pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Enumerative combinatorics and applications
سال: 2022
ISSN: ['2710-2335']
DOI: https://doi.org/10.54550/eca2023v3s1r4