Computing finite commutative semigroups. II. (Q1423715)

[For part I cf. Semigroup Forum 53, No. 2, 140-154 (1996; Zbl 0864.20034).] This paper considers the number of distinct commutative semigroups \(S\) of order \(n=|S|\) in case of having 0. We define the order \(<\) in the set of binary operations on \(S\) as follows: \(m',m''\colon S\times S\to S\), \(m'<m''\Leftrightarrow\exists a,b\in S\): \(m'(x,y)=m''(x,y)\) for all \(x<a\) and all \(y\in S\), and \(m'(a,y)=m''(a,y)\) for all \(y<b\), \(m'(a,b)<m''(a,b)\). For each permutation \(\sigma\) of \(S\) define \(m^\sigma\colon S\times S\to S\) by \(m^\sigma(x,y)=\sigma^{-1}m(\sigma x,\sigma y)=\sigma^{-1}(\sigma x\cdot\sigma y)\) for all \(x,y\in S\). \(S\) has precedence if \(m^\sigma\geq m\) for every permutation \(\sigma\) of \(S\). \(S\) has weak precedence if \(m^\tau\geq m\) for every transposition \(\tau\) of \(S\). All commutative semigroups on \(S\) are computed in lexicographic order, precedence means that the semigroup \(S\) is not isomorphic to any previously computed semigroup. This is a basic principle of the method of the paper. Let \(N\) be the annihilator of \(S\). Assume \(S\) is not a null semigroup. Let \(k\) be the least element of \(S\setminus N\), \(N=\{x\in S\mid x<k\}\). In case \(S\) has zero and has precedence, \(\pi(s_1)\geq\pi(s_2)\geq\cdots\geq\pi(s_n)\) where \(\pi(s)=|P(s)|\), \(P(s)=\{x\in S\mid kx=s\}\). To study more precisely, consider the four cases depending on the behavior of \(k^2\). For each case the author obtains detailed results. In case \(S\) has 0 and has a permutation such that \(\sigma k>k\), the head sequence and the tail sequence are considered. The head sequence of \(l\geq k\) is composed of \(\gamma(l)\), \(\rho(0)\), \(\delta(l)\). First \(\gamma(l)\) is defined as follows: \(\gamma(l)=1\) if \(l^2\neq l\) and \(l^2\geq k\); \(=2\), if \(l^2=l\); \(=3\), if \(0<l^2<k\); \(=4\), if \(l^2=0\). Definition of \(\rho(0)\): \(\rho(0)=|R(0)|\) where \(R(t)=\{x\in S\mid lx=t\}\), \(l\geq k\). Finally \(\delta(l)=|\Delta(l)|\), \(\Delta(l)=R(l)\) if \(l^2=l\); \(R(l^2)\) if \(0<l^2<k\), \(R(l)\) if \(l^2=0\), \(lS\cap N=\{0\}\), \(S\) if \(l^2=0\), \(lS\cap N\neq\{0\}\). The tail sequence of \(l\geq k\) is \(\rho(t_1),\rho(t_2),\dots,\rho(t_n)\) where \(n\geq 0\), \(\{t_1,t_2,\dots,t_n\}=lS\setminus\{0,l\}\) if \(l^2=l\); \((lS\cap N)\setminus\{0,l^2\}\) if \(0<l^2<l\); \((lS\cap N)\setminus\{0\}\) if \(l^2=0\), and \(lS\cap N\neq\{0\}\), \(lS\setminus\{0,l\}\) if \(l^2=0\) and \(lS\cap N=\{0\}\). A permutation \(\sigma\) on \(S\) is said to deny precedence if \(m^\sigma<m\). Assume \(S\) has zero, \(\sigma\) is said to conform precedence if \(m^\sigma\geq m\), where \(m\colon S\times S\to S\). \(S\) has subprecedence if \(S\) has weak precedence and satisfies one of the following: \[ k^2=k\text{ and } kS=\{0,k,s_1,s_2,\dots,s_m\}\text{ with }m\geq 0\text{ and }0 <k<s_1<s_2<\cdots<s_m,\tag{1} \] \[ 0<k^2<k \text{ and }kS=\{0,k^2,s_1,\dots,s_m\}\text{ with }m\geq 0\text{ and }0<k^2<s_1<\cdots<s_m<k,\tag{2} \] \[ k^2=0,\;kS\subseteq N\text{ and } kS=\{0,s_1,\dots,s_m\}\text{ with }m>0\text{ and } 0<s_1<\cdots<s_m<k,\tag{3} \] \[ k^2=0,\;kS\nsubseteq N\text{ and }kS=\{0,k,s_1,\dots,s_m\}\text{ with } m>0\text{ and }k<s_1<\cdots<s,\tag{4} \] and in each case \(\pi(s_1)\geq\pi(s_2)\geq\cdots\geq\pi(s_m)\). The profile of \(l>k\) is the sequence \(\gamma(l),\rho(0),\delta(l),\rho(t_1),\rho(t_2),\dots,\rho(t_n)\). Now finally the author let \(l>k\), if \(l\) has higher profile than \(k\), then some \(\sigma\in\Sigma\) transforms the row of \(l\) into a row which is smaller than the row of \(k\) in the sense of lexicograph. If \(l\) has lower profile than the row of \(k\), then every \(\sigma\in\Sigma\) transforms the row of \(l\) into a row which is greater than the row of \(k\) in the sense of lexicograph. These theorems are proved under the assumption of having zero and subprecedence. Finally the number of commutative semigroups of order 10 is given.