Counting occurrences of 132 in an even permutation

Simple item page
dc.creatorMansour, T.
dc.date2002-11-13
dc.date.accessioned2026-07-07T04:52:53Z
dc.date.available2026-07-07T04:52:53Z
dc.descriptionWe study the generating function for the number of even (or odd) permutations on n letters containing exactly $r\gs0$ occurrences 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.description12 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/math/0211205
dc.identifierhttp://arxiv.org/abs/math/0211205
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65638
dc.subjectCombinatorics
dc.subject05A0A; 05A15; 05C90
dc.titleCounting occurrences of 132 in an even permutation
dc.typetext

Files

Collections

arXiv