Restricted permutations and Chebyshev polynomials

Simple item page
dc.creatorMansour, T.
dc.creatorVainshtein, A.
dc.date2000-11-17
dc.date2002-01-09
dc.date.accessioned2026-07-07T04:38:39Z
dc.date.available2026-07-07T04:38:39Z
dc.descriptionWe study generating functions for the number of permutations in $\SS_n$ subject to two restrictions. One of the restrictions belongs to $\SS_3$, while the other to $\SS_k$. It turns out that in a large variety of cases the answer can be expressed via Chebyshev polynomials of the second kind.
dc.description17 pages, 5 figures
dc.identifierhttps://arxiv.org/abs/math/0011127
dc.identifierhttp://arxiv.org/abs/math/0011127
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60367
dc.subjectCombinatorics
dc.subject05A05; 05A15; 30B70; 42C05
dc.titleRestricted permutations and Chebyshev polynomials
dc.typetext

Files

Collections

arXiv