Restricted even permutations and Chebyshev polynomials

Simple item page
dc.creatorMansour, Toufik
dc.date2003-02-02
dc.date.accessioned2026-07-07T04:54:51Z
dc.date.available2026-07-07T04:54:51Z
dc.descriptionWe study generating functions for the number of even (odd) permutations on n letters avoiding 132 and an arbitrary permutation $τ$ on k letters, or containing $τ$ exactly once. In several interesting cases the generating function depends only on k and is expressed via Chebyshev polynomials of the second kind.
dc.description20 pages
dc.identifierhttps://arxiv.org/abs/math/0302014
dc.identifierhttp://arxiv.org/abs/math/0302014
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66423
dc.subjectCombinatorics
dc.subject05A05; 05A15; 30B70; 42C05
dc.titleRestricted even permutations and Chebyshev polynomials
dc.typetext

Files

Collections

arXiv