On the least exponential growth admitting uncountably many closed permutation classes
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0307399,
title = {On the least exponential growth admitting uncountably many closed permutation classes},
author = {Martin Klazar},
journal= {arXiv preprint arXiv:math/0307399},
year = {2007}
}
备注
13 pages