restricted 1-3-2 permutations and generalized patterns

Details restricted 1-3-2 permutations and generalized patterns restricted 1-3-2 permutations and generalized patterns

2001-10-03

arxiv.org/abs/math/0110039v1

Mathematics

Combinatorics

10 pages

Scientific paper

Recently, Babson and Steingrimsson (see [BS]) introduced generalized permutations patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We study generating functions for the number of permutations on $n$ letters avoiding $1-3-2$ (or containing $1-3-2$ exactly once) and an arbitrary generalized pattern $\tau$ on $k$ letters, or containing $\tau$ exactly once. In several cases the generating function depends only on $k$ and is expressed via Chebyshev polynomials of the second kind, and generating function of Motzkin numbers.

Affiliated with

Also associated with

No associations

Rating

restricted 1-3-2 permutations and generalized patterns 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 restricted 1-3-2 permutations and generalized patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and restricted 1-3-2 permutations and generalized patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-475096