Dokazujeme dolní a horní mez na nejmenší exponenciální růst uzavřené množiny permutací povolující nespočetně mnoho takových množin. Tyto meze jsou 2^n a (2.33529...)^n. (cs)
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. (en)