Restricted 3412-Avoiding Involutions: Continued Fractions, Chebyshev Polynomials and Enumerations

Simple item page
dc.creatorEgge, Eric S.
dc.date2003-07-03
dc.date.accessioned2026-07-07T04:59:24Z
dc.date.available2026-07-07T04:59:24Z
dc.descriptionSeveral authors have examined connections among restricted permutations, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for involutions which avoid 3412. Our results include a recursive procedure for computing the generating function for involutions which avoid 3412 and any set of additional patterns. We use our results to give enumerations and generating functions for involutions which avoid 3412 and various sets of additional patterns. In many cases we express these generating functions in terms of Chebyshev polynomials of the second kind.
dc.description26 pages
dc.identifierhttps://arxiv.org/abs/math/0307050
dc.identifierhttp://arxiv.org/abs/math/0307050
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/67969
dc.subjectCombinatorics
dc.subject05A05; 05A15
dc.titleRestricted 3412-Avoiding Involutions: Continued Fractions, Chebyshev Polynomials and Enumerations
dc.typetext

Files

Collections

arXiv