From Fibonacci to Catalan permutations

Details From Fibonacci to Catalan permutations From Fibonacci to Catalan permutations

2006-12-11

arxiv.org/abs/math/0612277v1

Mathematics

Combinatorics

1 figure

Scientific paper

It is well known that permutations avoiding any 3-length pattern are enumerated by the Catalan numbers. If the three patterns 123, 132 and 213 are avoided at the same time we obtain a class of permutations enumerated by the Fibonacci numbers. We start from these permutations and make one or two forbidden patterns disappear by suitably "generalizing" them. In such a way we find several classes of permutations enumerated by integer sequences which lay between the Fibonacci and Catalan numbers. For each class, we provide the generating function according to the length of the permutations. Moreover, as a result, we introduce a sort of "continuity" among the number sequences enumerating these classes of permutations.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-183637