Every semigroup is isomorphic to a transitive semigroup of binary relations

DOI10.1090/S0002-9947-97-01708-XzbMATH Open0888.20042OpenAlexW1580388971MaRDI QIDQ5690975FDOQ5690975

Authors: Ralph McKenzie, Boris M. Schein 

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

Recommendations

• Semigroups of tolerance relations
• Publication:4504806
• Binary relations as lattice isomorphisms
• Transitive representations of inverse semigroups.
• Multigroups

zbMATH Keywords

finite semigroupspartially ordered 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)

Cites Work

• Title not available (Why is that?)
• Representation of involuted semigroups by binary relations
• Representations of ordered semigroups and lattices by binary relations
• A new representation theorem for completely \([0-]\) simple semigroups
• Title not available (Why is that?)

Cited In (4)

• The lattice and semigroup structure of multipermutations
• Algebraic approaches to the analysis of social networks
• Semigroups generated by partitions
• Representation theory of finite semigroups over semirings.

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

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