Compatible orders on the bicyclic semigroup

From MaRDI portal





The bicyclic semigroup \(B\) is a semigroup generated by symbols \(a,b\) subject to the relation \(ab=1\) where \(1\) is the identity. Then the elements of \(B\) can be uniquely expressed in the form \(b^ra^s\) under the multiplication \(b^ra^s\cdot b^ua^v=b^pa^q\), where \(p=(u\vee s)-s+r\) and \(q=(s\vee u)-u+v\). In this paper, the author proves that \(B\) admits exactly four compatible total orders (Theorem 1.7). In addition to the four total orders, the bicyclic semigroup \(B\) admits two infinite families of distinct partial orders \(\leq\) which turn \(B\) into a \(\vee\)-semilatticed inverse semigroup, and admits two infinite families of distinct partial orders \(\leq\) which turn \(B\) into \(\wedge\)-semilatticed inverse semigroup (Theorems 6.2, 6.3). \(B\) admits no lattice ordering which is not a total ordering (Theorem 5.3). He also proves that the bicyclic semigroup \(B\) admits exactly four compatible semilattice orderings two of these are right amenable, the others are left amenable (Theorem 6.4), but \(B\) admits no compatible semilattice ordering which is both left and right amenable [the author, J. Algebra 65, 118-146 (1980; Zbl 0448.06012)].











This page was built for publication: Compatible orders on the bicyclic semigroup

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4262367)