Counting occurences of 132 in a permutation

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We 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}$.
9 pages, 2 figures

Keywords

Combinatorics, 05A05; 05A15; 05C90

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv