Enumerating pattern avoidance for affine permutations

Details Enumerating pattern avoidance for affine permutations Enumerating pattern avoidance for affine permutations

2010-02-09

arxiv.org/abs/1002.1933v2

Electron. J. Combin., 17 (2010), pp. Research Paper 127, 13 pp. (electronic)

Mathematics

Combinatorics

11 pages, 3 figures; fixed typos and proof of Proposition 6

Scientific paper

In this paper we study pattern avoidance for affine permutations. In particular, we show that for a given pattern p, there are only finitely many affine permutations in $\widetilde{S}_n$ that avoid p if and only if p avoids the pattern 321. We then count the number of affine permutations that avoid a given pattern p for each p in S_3, as well as give some conjectures for the patterns in S_4.

Affiliated with

Also associated with

No associations

Rating

Enumerating pattern avoidance for affine 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 Enumerating pattern avoidance for affine permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating pattern avoidance for affine permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125236