Restricted set of patterns, continued fractions, and Chebyshev polynomials

T. Mansour

Restricted set of patterns, continued fractions, and Chebyshev polynomials

Combinatorics 2007-05-23 v1

Authors: T. Mansour

Abstract

We study generating functions for the number of permutations in $S_n$ subject to set of restrictions. One of the restrictions belongs to $S_3$ , while the others to $S_k$ . It turns out that in a large variety of cases the answer can be expressed via continued fractions, and Chebyshev polynomials of the second kind.

Keywords

permutations continued fractions pattern avoidance in permutations

Cite

@article{arxiv.math/0108043,
  title  = {Restricted set of patterns, continued fractions, and Chebyshev polynomials},
  author = {T. Mansour},
  journal= {arXiv preprint arXiv:math/0108043},
  year   = {2007}
}

Comments

9 pages

Related papers

View all related →