The \(p_n\) sequences of semigroup varieties generated by combinatorial 0-simple semigroups.
A semigroup is called combinatorial if it does not contain nontrivial subgroups; a Rees matrix semigroup \((I\times G\times\Lambda)\cup\{0\}\) is combinatorial if the group \(G\) is trivial. Here are presented asymptotic formulas for the size of \(n\)-generated free combinatorial semigroups in all 9 varieties generated by combinatorial 0-simple semigroups.
scientific article; zbMATH DE number 5508758
scientific article