Pattern avoidance in compositions and multiset permutations

Details Pattern avoidance in compositions and multiset permutations Pattern avoidance in compositions and multiset permutations

2005-04-14

arxiv.org/abs/math/0504310v1

Mathematics

Combinatorics

8 pages, no figure

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Pattern avoidance in compositions and multiset permutations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Pattern avoidance in compositions and multiset permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Pattern avoidance in compositions and multiset permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-401754