Every semigroup is isomorphic to a transitive semigroup of binary relations

DOI10.1090/S0002-9947-97-01708-XzbMath0888.20042OpenAlexW1580388971MaRDI QIDQ5690975

Boris M. Schein, Ralph McKenzie

Publication date: 9 January 1997

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9947-97-01708-x

zbMATH Keywords

partially ordered semigroupsfinite semigroupstransitive representationslabeled multigraphstransitive semigroups of binary relationstransitive semigroups of multipermutations

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Ordered semigroups and monoids (06F05) Representation of semigroups; actions of semigroups on sets (20M30)

Related Items (3)

Semigroups generated by partitions ⋮ The lattice and semigroup structure of multipermutations ⋮ Representation theory of finite semigroups over semirings.

Cites Work

• Unnamed Item
• Unnamed Item
• A new representation theorem for completely \([0-\) simple semigroups]
• Representation of involuted semigroups by binary relations
• Representations of ordered semigroups and lattices by binary relations

This page was built for publication: Every semigroup is isomorphic to a transitive semigroup of binary relations