On the least exponential growth admitting uncountably many closed permutation classes

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We show that the least exponential growth of counting functions which admits uncountably many closed permutation classes lies between 2^n and (2.33529...)^n.
13 pages

Keywords

Combinatorics, 05A05; 05A15; 06A07

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv