Permutations avoiding a nonconsecutive instance of a 2- or 3-letter pattern

Details Permutations avoiding a nonconsecutive instance of a 2- or 3-letter pattern Permutations avoiding a nonconsecutive instance of a 2- or 3-letter pattern

2006-10-13

arxiv.org/abs/math/0610428v2

Mathematics

Combinatorics

Acknowledgment of priority

Scientific paper

We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The counting sequences for the two representative three-letter patterns, 321 and 132, have respective generating functions (1+x^2)(C(x)-1)/(1+x+x^2-x C(x)) and C(x+x^3) where C(x) is the generating function for the Catalan numbers.

Affiliated with

Also associated with

No associations

Rating

Permutations avoiding a nonconsecutive instance of a 2- or 3-letter pattern 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 Permutations avoiding a nonconsecutive instance of a 2- or 3-letter pattern, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Permutations avoiding a nonconsecutive instance of a 2- or 3-letter pattern will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-664982