Nilsemigroups on trees (Q1176622)

Finite commutative nilsemigroups are basic building blocks for finite commutative semigroups and have been constructed in various ways by the reviewer [Proc. Japan Acad. 40, 94--98 (1964; Zbl 0121.26903); and Bull. Shimane Univ., Nat. Sci. 15, 1--11 (1965)], \textit{C. C. John jun.} [Doct. Diss., Kansas State Univ., The construction of finite commutative semigroup (1973)], \textit{E. J. Tully jun.} [Proc. Am. Math. Soc. 17, 1133--1139 (1966; Zbl 0154.01803)], \textit{T. Tamura} [Proc. Japan Acad. 42, 35--40, 545--548 (1966; Zbl 0163.02202); and Math. Nachr. 36, 225--287 (1968; Zbl 0155.04201)], and \textit{B. D. Arendt} and \textit{C. J. Stuth} [Pac. J. Math. 35, 7--9 (1970; Zbl 0209.32504)], etc. Let \(N\) be a finite commutative nilsemigroup. Under the divisibility order on \(N\), \(x\leq y\) if and only if \(x=y\) or \(x=ay\) for some \(a\in N\). The partially ordered set \(X=\{N,\leq\}\) underlies the nilsemigroup \(N\). In this paper, the author investigates another construction, in which a finite commutative nilsemigroup \(N\) is reconstructed from its underlying partially ordered set. Further, he gives some results on the following problem: When does a partially ordered set underlie a finite commutative nilsemigroup? This problem is the commutative nilsemigroup version of the problem of \textit{J. Rhodes} (given in his paper [Semigroup Forum 7, 92--103 (1974; Zbl 0294.20057)]) for finite semigroups.