Restricted 132-avoiding permutations

Simple item page
dc.creatorMansour, T.
dc.creatorVainshtein, A.
dc.date2000-10-04
dc.date2000-11-07
dc.date.accessioned2026-07-07T04:37:51Z
dc.date.available2026-07-07T04:37:51Z
dc.descriptionWe study generating functions for the number of 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.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0010047
dc.identifierhttp://arxiv.org/abs/math/0010047
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/60057
dc.subjectCombinatorics
dc.subject05A05; 05A15; 30B70; 42C05
dc.titleRestricted 132-avoiding permutations
dc.typetext

Files

Collections

arXiv