Permutations Avoiding Two Patterns of Length Three
نویسنده
چکیده
We study permutations that avoid two distinct patterns of length three and any additional set of patterns. We begin by showing how to enumerate these permutations using generating trees, generalizing the work of Mansour [13]. We then find sufficient conditions for when the number of such permutations is given by a polynomial and answer a question of Egge [6]. Afterwards, we show how to use these computations to count permutations that avoid two distinct patterns of length three and contain other patterns a prescribed number of times.
منابع مشابه
Permutations Avoiding a Pair of Generalized Patterns of Length Three with Exactly One Adjacent Pair of Letters
Abstract. In [1] Babson and Steingŕımsson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. Claesson [2] presented a complete solution for the number of permutations avoiding any single (generalized) pattern of length three with exactly one adjacent pair of letters. For eight of these twelve pattern...
متن کاملSymmetric Permutations Avoiding Two Patterns ∗
Symmetric pattern-avoiding permutations are restricted permutations which are invariant under actions of certain subgroups of D4, the symmetry group of a square. We examine pattern-avoiding permutations with 180◦ rotational-symmetry. In particular, we use combinatorial techniques to enumerate symmetric permutations which avoid one pattern of length three and one pattern of length four. Our resu...
متن کاملAvoiding patterns in irreducible permutations
We explore the classical pattern avoidance question in the case of irreducible permutations, i.e., those in which there is no index i such that σ(i + 1) − σ(i) = 1. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary nu...
متن کامل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...
متن کاملThe equidistribution of some vincular patterns on 132-avoiding permutations
A pattern in a permutation π is a sub-permutation of π, and this paper deals mainly with length three patterns. In 2012 Bóna showed the rather surprising fact that the cumulative number of occurrences of the patterns 231 and 213 are the same on the set of permutations avoiding 132, even though the pattern based statistics 231 and 213 do not have the same distribution on this set. Here we show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره on شماره
صفحات -
تاریخ انتشار 2002