932 research outputs found
Pattern Avoidance in Poset Permutations
We extend the concept of pattern avoidance in permutations on a totally
ordered set to pattern avoidance in permutations on partially ordered sets. The
number of permutations on that avoid the pattern is denoted
. We extend a proof of Simion and Schmidt to show that for any poset , and we exactly classify the posets for which
equality holds.Comment: 13 pages, 1 figure; v2: corrected typos; v3: corrected typos and
improved formatting; v4: to appear in Order; v5: corrected typos; v6: updated
author email addresse
Pattern avoidance in compositions and multiset permutations
We study pattern avoidance by combinatorial objects other than permutations,
namely by ordered partitions of an integer and by permutations of a multiset.
In the former case we determine the generating function explicitly, for integer
compositions of n that avoid a given pattern of length 3 and we show that the
answer is the same for all such patterns. We also show that the number of
multiset permutations that avoid a given three-letter pattern is the same for
all such patterns, thereby extending and refining earlier results of Albert,
Aldred et al., and by Atkinson, Walker and Linton. Further, the number of
permutations of a multiset S, with a_i copies of i for i = 1, ..., k, that
avoid a given permutation pattern in S_3 is a symmetric function of the a_i's,
and we will give here a bijective proof of this fact first for the pattern
(123), and then for all patterns in S_3 by using a recently discovered
bijection of Amy N. Myers.Comment: 8 pages, no figur
- …