Pattern avoidance in circular permutations

Details Pattern avoidance in circular permutations Pattern avoidance in circular permutations

2002-10-01

arxiv.org/abs/math/0210014v1

Mathematics

Combinatorics

LaTeX

Scientific paper

Circular permutations on {1,2,...,n} that avoid a given pattern correspond to ordinary (linear) permutations that end with n and avoid all cyclic rotations of the pattern. Three letter patterns are all but unavoidable in circular permutations and here we give explicit formulas for the number of circular permutations that avoid one four letter pattern. In the three essentially distinct cases, the counts are as follows: the Fibonacci number F_{2n-3} for the pattern 1324, 2^{n-1}-(n-1) for 1342, and 2^{n}+1-2n-{n}choose{3} for 1234.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-165105