Decomposing simple permutations, with enumerative consequences

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences. This result has applications to the enumeration of restricted permutations. For example, it immediately implies a result of Bona and (independently) Mansour and Vainshtein that for any r, the number of permutations with at most r copies of 132 has an algebraic generating function.

Keywords

Combinatorics

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv