Counting occurrences of 3412 in an involution

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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.
12 pages, 4 figures

Keywords

Combinatorics, 05A05; 05A15; 05C90

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/69882

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0401218
 http://arxiv.org/abs/math/0401218

Collections

arXiv