Counting occurences of 132 in a permutation

Simple item page
dc.creatorMansour, Toufik
dc.creatorVainshtein, Alek
dc.date2001-05-09
dc.date2001-08-02
dc.date.accessioned2026-07-07T04:41:38Z
dc.date.available2026-07-07T04:41:38Z
dc.descriptionWe study the generating function for the number of permutations on n letters containing exactly $r\gs0$ occurences of 132. It is shown that finding this function for a given r amounts to a routine check of all permutations in $S_{2r}$.
dc.description9 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0105073
dc.identifierhttp://arxiv.org/abs/math/0105073
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/61441
dc.subjectCombinatorics
dc.subject05A05; 05A15; 05C90
dc.titleCounting occurences of 132 in a permutation
dc.typetext

Files

Collections

arXiv