Counting occurrences of 3412 in an involution

Simple item page
dc.creatorMansour, Toufik
dc.date2004-01-18
dc.date.accessioned2026-07-07T05:04:38Z
dc.date.available2026-07-07T05:04:38Z
dc.descriptionWe study the generating function for the number of involutions on $n$ letters containing exactly $r\gs0$ occurrences of 3412. It is shown that finding this function for a given $r$ amounts to a routine check of all involutions on $2r+1$ letters.
dc.description12 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/0401218
dc.identifierhttp://arxiv.org/abs/math/0401218
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/69882
dc.subjectCombinatorics
dc.subject05A05; 05A15; 05C90
dc.titleCounting occurrences of 3412 in an involution
dc.typetext

Files

Collections

arXiv