On orders in normal cryptogroups. (Q1758330): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3848243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely 0-simple semigroups of quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely 0-simple semigroups of quotients III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orders in normal bands of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clifford semigroups of left quotients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congruences on strong semilattices of regular simple semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orders in completely regular semigroups / rank
 
Normal rank

Latest revision as of 20:13, 5 July 2024

scientific article
Language Label Description Also known as
English
On orders in normal cryptogroups.
scientific article

    Statements

    On orders in normal cryptogroups. (English)
    0 references
    0 references
    9 November 2012
    0 references
    Given a semigroup \(Q\), a subsemigroup \(S\) of \(Q\) is said to be an \textit{order} in \(Q\) if every element of \(Q\) is a ``quotient'' of elements of \(S\), i.e., for all \(q\in Q\) there exist \(a,b,c,d\in S\) such that \(a\) and \(d\) belong to (maximal) subgroups of \(Q\) and \(q=a^{-1}b=cd^{-1}\), where \(a^{-1}\) and \(d^{-1}\) are the inverses of \(a\) and \(d\) in the respective subgroups. Orders have been the object of study for quite some time, as shown by \textit{V. Gould}, [Proc. Edinb. Math. Soc., II. Ser. 35, No. 2, 213-226 (1992; Zbl 0791.20071)], there exist different semigroups of quotients \(Q\) over the same order \(S\) and so one may want to study the semigroups \(Q\) fixed \(S\) or to strengthen \(S\) to imply uniqueness of \(Q\). The work of V. Gould, [for example in loc. cit.], goes in the second direction. Here the author is concerned with the first aim and presents results that follow joint work with \textit{J. Fountain} [\textit{J. Fountain} and \textit{M. Petrich}, J. Algebra 101, 365-402 (1986; Zbl 0589.20041); Math. Proc. Camb. Philos. Soc. 105, No. 2, 263-275 (1989; Zbl 0687.20056); Mathematika 43, No. 2, 295-319 (1996; Zbl 0876.20038)] for semigroups \(Q\) that are completely \(0\)-simple or normal bands of groups. Given an order \(S\) in a normal cryptogroup \(Q\), i.e., a normal band of groups, the restrictions of the Green relations on \(Q\) to \(S\) are characterized (Theorem 4.1). Also, if \(S\) is an order in another normal cryptogroup \(P\) it is discussed when such restrictions, regarding \(Q\) and \(P\), are related (Theorem 4.4), in particular it is shown that the \(\mathcal H\)-restrictions coincide if and only if \(P\) and \(Q\) are isomorphic in a way that the elements of \(S\) are left fixed (Corollary 4.5). The next section is dedicated to the study of certain relations denoted by \(\sim\), \(\sim_r\), \(\sim_l\) and \(\sim_t=\sim_r\cap\sim_l\). The relations \(\sim\) and \(\sim_l\) are defined on a semigroup \(M\) for all \(a,b\in M\) by, \[ a\sim b\text{ iff }(\forall x,y\in M,\;ax=ay,\;xa=ya\Leftrightarrow bx=by,\;xb=yb), \] and \[ a\sim_lb\text{ iff } a\sim b\sim xa=yb,\text{ for some }x,y\in M. \] For example, the semigroups \(M\) in which \(\sim\) is a semilattice congruence such that the classes of the idempotents are weakly cancellative are described in Theorem 5.2. Various results with this flavour are obtained considering \(\sim\), \(\sim_r\), \(\sim_l\) and \(\sim_t\). An order \(S\) is \textit{distinguished} in \(Q\) if \(\sim_l\) and \(\sim_r\) are, respectively, the restrictions of \(\mathcal L\) and \(\mathcal R\) on \(Q\) to \(S\). Distinguished orders \(S\) in a normal cryptogroup \(Q\) are discussed.
    0 references
    orders
    0 references
    semigroups of quotients
    0 references
    normal cryptogroups
    0 references
    distinguished orders
    0 references
    Green relations
    0 references
    reversible cancellative semigroups
    0 references

    Identifiers