132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers

Details 132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers 132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers

2002-05-19

arxiv.org/abs/math/0205206v1

Mathematics

Combinatorics

17 pages

Scientific paper

In 1990 West conjectured that there are $2(3n)!/((n+1)!(2n+1)!)$ two-stack sortable permutations on $n$ letters. This conjecture was proved analytically by Zeilberger in 1992. Later, Dulucq, Gire, and Guibert gave a combinatorial proof of this conjecture. In the present paper we study generating functions for the number of two-stack sortable permutations on $n$ letters avoiding (or containing exactly once) 132 and avoiding (or containing exactly once) an arbitrary permutation $\tau$ on $k$ letters. In several interesting cases this generating function can be expressed in terms of the generating function for the Fibonacci numbers or the generating function for the Pell numbers.

Affiliated with

Also associated with

No associations

Rating

132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers 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 132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 132-avoiding Two-stack Sortable Permutations, Fibonacci Numbers, and Pell Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-11920