restricted 1-3-2 permutations and generalized patterns

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-475096

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.