Patterns and Fractions

dc.creatorRobertson, Aaron
dc.creatorWilf, Herb
dc.creatorZeilberger, Doron
dc.date1999-06-23
dc.date.accessioned2026-07-07T05:29:37Z
dc.date.available2026-07-07T05:29:37Z
dc.descriptionWe find, in the form of a continued fraction, the generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns, and show how to extend this to permutations that have exactly one (132) pattern. We find some properties of the continued fraction, which is similar to, though more general than, those that were studied by Ramanujan.
dc.descriptionThis paper supercedes "The number of permutations with a prescribed number of 132 and 123 patterns" (math.CO/9903170)
dc.identifierhttps://arxiv.org/abs/math/9906154
dc.identifierhttp://arxiv.org/abs/math/9906154
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78707
dc.subjectCombinatorics
dc.subject05A15
dc.titlePatterns and Fractions
dc.typetext

Files

Collections