Publikace na Matematicko-fyzikální fakulta |
2004
Abstrakt
We prove lower and upper bounds on the least exponential growth of a closed set of permutations which admits uncountably many such sets. The bounds are 2^n and (2.33529...)^n.
We prove lower and upper bounds on the least exponential growth of a closed set of permutations which admits uncountably many such sets. The bounds are 2^n and (2.33529...)^n.