On the semigroup of order-preserving partial isometries of a finite chain with restricted range (Q2070984)

Let \(X_{n}=\{1,2,\ldots,n\}\) be an \(n\)-element set of the first \(n\geq2\) natural numbers under the natural ordering and let \(I_{n}\) be the symmetric inverse semigroup on \(X_n\), i.e. the partial one-to-one transformation semigroup on \(X_n\) under composition of mappings. A transformation \(\alpha \in I_{n}\) is called order-preserving if \(x\leq y\) implies \(x\alpha \leq y\alpha \) for all \(x,y\) in the domain of \(\alpha\). A transformation \(\alpha \in I_{n}\) is called an isometry (or distance-preserving) if \(|x-y|=|x\alpha-y\alpha|\) for all \(x,y\) in the domain of \(\alpha\). The set of all partial order-preserving isometries on \(X_{n}\) forms a semigroup, denoted by \(ODP_{n}\). The semigroup \(ODP_n\) is an inverse subsemigroup of \(I_n\). Let \(Y\) be a nonempty subset of \(X\), and denote by \(T(X,Y)\) the subsemigroup \(\{\alpha \in T(X) \mid X \alpha \subseteq Y\}\) of \(T(X)\) of all elements with range (image) restricted to \(Y\). In 1975, \textit{J. S. V. Symons} [J. Aust. Math. Soc., Ser. A 19, 413--425 (1975; Zbl 0323.20067)] introduced and studied the semigroup \(T(X,Y)\), which is called semigroup of transformations with restricted range. In the paper under review, the authors fix \(Y = \{1,2,\ldots,r\} \subseteq X_n\) and study the semigroup \(ODPI_{n,r} = \{\alpha \in ODP_n : \operatorname{im}\alpha \subseteq Y\}\) of all partial order-preserving isometries on \(X_{n}\) with restricted range \(Y\). First, they give a necessary and sufficient condition for \(ODPI_{n,r}\) to be an inverse subsemigroup of \(ODP_n\) and characterize Green's relations on \(ODPI_{n,r}\). There is a technical mistake in Theorem 3.3. The reader could see that the statements of Theorem 3.2 and Theorem 3.3 are the same, but the proofs are different. The first one is for the \(\mathcal L\) relation and the next is for the \(\mathcal R\) relation. Thus, the statement of Theorem 3.3 must be for the \(\mathcal R\) relation. In the last section, the authors investigate the cardinality of \(ODPI_{n,r}\) and compute its rank. The cardinality of \(ODPI_{n,r}\) is calculated to be \((n - r + 3)2^r - (n + r ) - 2\). The rank of a semigroup \(S\) is defined to be the minimal number of elements of a generating set of \(S\). The authors prove that the rank of \(ODPI_{n,r}\) is equal to \(n\).