Block-groups and Hall relations

From MaRDI portal



Abstract: A binary relation on a finite set is called a Hall relation if it contains a permutation of the set. Under the usual relational product, Hall relations form a semigroup which is known to be a block-group, that is, a semigroup with at most one idempotent in each mathrsfsR-class and each mathrsfsL-class. Here we show that in a certain sense, the converse is true: every block-group divides a semigroup of Hall relations on a finite set.












This page was built for publication: Block-groups and Hall relations

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