The number of boundedly generated semigroups is super-exponential in the cardinality (Q722574)

For a given positive integer \(n >1\), let \(\gamma\) be an equivalence relation on \(\{1, \ldots, n\}\). Define \(S_\gamma\) to be the semigroup with 0 having the presentation \(\langle x, y \mid x^2 = y^{n+1} = yxy = 0, xy^ix = xy^j x, \forall(i,j) \in \gamma\rangle\). It is shown that \(|S_\gamma| \leq 4n+2\) and that \(S_\gamma \cong S_{\gamma'} \) if and only if \(\gamma = \gamma'\). From results of \textit{R. Jakimczuk} [J. Integer Seq. 14, No. 5, Article 11.5.8, 11 p. (2011; Zbl 1229.11040)] on the (Bell) number \(B_n\) of equivalence relations on an \(n\)-element set, it follows that the number of 2-generated semigroups is not exponentially bounded in the cardinality. This answers a question of \textit{A. Bailey} et al. [Isr. J. Math. 215, No. 1, 459--501 (2016; Zbl 1398.20066)].