SMALL CANCELLATION CONDITIONS AND EMBEDDABILITY OF SEMIGROUPS IN GROUPS (Q4029567)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 139526
Language Label Description Also known as
default for all languages
No label defined
    English
    SMALL CANCELLATION CONDITIONS AND EMBEDDABILITY OF SEMIGROUPS IN GROUPS
    scientific article; zbMATH DE number 139526

      Statements

      SMALL CANCELLATION CONDITIONS AND EMBEDDABILITY OF SEMIGROUPS IN GROUPS (English)
      0 references
      0 references
      28 March 1993
      0 references
      presentation
      0 references
      semigroups
      0 references
      embeddable in groups
      0 references
      Let the semigroup \(S\) have the presentation \(\langle a_ 1,\dots,a_ n\); \(A_ 1=B_ 1,\dots\rangle\), \({\mathcal C}\) be \(\{A_ 1,B_ 1,A_ 2,\dots\}=\{C_ j\}\), where all the \(C_ j\) are non-empty and distinct. A word \(X\) is called an \(s\)-piece if there are \(C_ j\), \(C_ k\) from \({\mathcal C}\) (possibly \(j=k\)) such that \(C_ j\equiv UXV\), \(C_ k\equiv PXQ\), where either \(U\) and \(P\) or \(V\) and \(Q\) are not graphically identical. Condition \(C_ s(p)\): If \(C\in{\mathcal C}\) and \(C\equiv X_ 1 X_ 2\dots X_ k\), where \(X_ i\) (\(i=1,2,\dots,k)\) is an \(s\)-piece, then \(k\geq p\). Condition \(D_ s(q)\): If the left or right graph of the presentation of \(S\) (according to S. I. Adyan) has a cycle of length \(l\), then \(l\geq q\). It is proved in this paper that all semigroups satisfying \(C_ s(3) \& D_ s(3)\) or \(C_ s(4) \& D_ s(2)\) are embeddable in groups. It is shown that given any natural number \(q\), there is a semigroup satisfying \(C_ s(2)\& D_ s(q)\) which is not embeddable in groups. The question as to whether all semigroups from \(C_ s(3) \& D_ s(2)\) are embeddable in groups remains open. (Any semigroup with \(C_ s(3) \& D_ s(2)\) is a cancellative semigroup).
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references