Restricted set of patterns, continued fractions, and Chebyshev polynomials

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
9 pages

Keywords

Combinatorics, 05A05; 05A15; 30B70; 42C05

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/61980

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0108043
 http://arxiv.org/abs/math/0108043

Collections

arXiv