A Wilf equivalence related to two stack sortable permutations

Details A Wilf equivalence related to two stack sortable permutations A Wilf equivalence related to two stack sortable permutations

2005-10-11

arxiv.org/abs/math/0510211v1

Mathematics

Combinatorics

LaTeX, 4 pages

Scientific paper

A permutation is so-called two stack sortable if it (i) avoids the (scattered) pattern 2-3-4-1, and (ii) contains a 3-2-4-1 pattern only as part of a 3-5-2-4-1 pattern. Here we show that the permutations on [n] satisfying condition (ii) alone are equinumerous with the permutations on [n] that avoid the mixed scattered/consecutive pattern 31-4-2. The proof uses a known bijection from 3-2-1-avoiding to 3-1-2-avoiding permutations.

Affiliated with

Also associated with

No associations

Rating

A Wilf equivalence related to two stack sortable 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 A Wilf equivalence related to two stack sortable permutations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Wilf equivalence related to two stack sortable permutations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-49000