加载中…
2003-07-31
On the least exponential growth admitting uncountably many closed permutation classes
Martin Klazar
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本