Pattern avoidance classes and subpermutations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

Pattern avoidance classes of permutations that cannot be expressed as unions of proper subclasses can be described as the set of subpermutations of a single bijection. In the case that this bijection is a permutation of the natural numbers a structure theorem is given. The structure theorem shows that the class is almost closed under direct sums or has a rational generating function.
18 pages, 4 figures (all in-line)

Keywords

Combinatorics, 05A05

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv