Avoidance of Partitions of a Three-element Set

Details Avoidance of Partitions of a Three-element Set Avoidance of Partitions of a Three-element Set

2006-03-20

arxiv.org/abs/math/0603481v4

Mathematics

Combinatorics

23 pages, 2 tables, 1 figure, to appear in Advances in Applied Mathematics

Scientific paper

Klazar defined and studied a notion of pattern avoidance for set partitions, which is an analogue of pattern avoidance for permutations. Sagan considered partitions which avoid a single partition of three elements. We enumerate partitions which avoid any family of partitions of a 3-element set as was done by Simion and Schmidt for permutations. We also consider even and odd set partitions. We provide enumerative results for set partitions restricted by generalized set partition patterns, which are an analogue of the generalized permutation patterns of Babson and Steingr{\'{\i}}msson. Finally, in the spirit of work done by Babson and Steingr{'{\i}}msson, we will show how these generalized partition patterns can be used to describe set partition statistics.

Affiliated with

Also associated with

No associations

Rating

Avoidance of Partitions of a Three-element Set 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 Avoidance of Partitions of a Three-element Set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Avoidance of Partitions of a Three-element Set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-451019