Groups of binary relations
From MaRDI portal
Publication:2543989
Cites work
Cited in
(13)- Finite binary relations have no more complexity than finite functions
- Maximal submonoids of the semigroup of binary relations
- Conference celebrating the 60th birthday of Robert J. Plemmons. Papers from the conference, Winston-Salem, NC, USA, January 1999
- Dedication to Robert J. Plemmons
- Combinatorial properties of binary semigroups
- A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations
- A matrix characterization of the maximal groups in \beta_X
- Semigroups generated by partitions
- Any group is a maximal subgroup of the semigroup of binary relations on some set
- Representation theory of finite semigroups over semirings.
- Minimal generating sets for matrix monoids
- Groupoids, idempotents and pointwise inverses in relational categories
- A proof of Devadze's theorem on generators of the semigroup of Boolean matrices.
This page was built for publication: Groups of binary relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2543989)