Restricted set of patterns, continued fractions, and Chebyshev polynomials

Simple item page
dc.creatorMansour, T.
dc.date2001-08-06
dc.date.accessioned2026-07-07T04:42:53Z
dc.date.available2026-07-07T04:42:53Z
dc.descriptionWe 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.
dc.description9 pages
dc.identifierhttps://arxiv.org/abs/math/0108043
dc.identifierhttp://arxiv.org/abs/math/0108043
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61980
dc.subjectCombinatorics
dc.subject05A05; 05A15; 30B70; 42C05
dc.titleRestricted set of patterns, continued fractions, and Chebyshev polynomials
dc.typetext

Files

Collections

arXiv