A proof of Devadze's theorem on generators of the semigroup of Boolean matrices.

DOI10.1007/s00233-011-9305-yzbMath1238.20069MaRDI QIDQ766192

Janusz Konieczny

Publication date: 23 March 2012

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00233-011-9305-y

zbMATH Keywords

semigroups of binary relations; minimal sets of generators; semigroups of Boolean matrices

Mathematics Subject Classification ID

20M20: Semigroups of transformations, relations, partitions, etc.

20M05: Free semigroups, generators and relations, word problems

Related Items

The lattice and semigroup structure of multipermutations, The complexity of weakly recognizing morphisms, Semigroups generated by partitions, Structure of the rational monoid algebra for Boolean matrices of order 3, Operations on Weakly Recognizing Morphisms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Idempotent Boolean matrices
• Primes in the semigroup of Boolean matrices
• Regular elements of the semigroup of all binary relations
• On generating regular elements in the semigroup of binary relations
• Inverses of Boolean matrices
• Complete semigroups of binary relations.
• Reduced idempotents in the semigroup of Boolean matrices
• Maximal subgroups of the semigroup of relations
• Groups of binary relations
• A proof of the Montague-Plemmons-Schein theorem on maximal subgroups of the semigroup of binary relations
• Any group is a maximal subgroup of the semigroup of binary relations on some set
• On the semigroup of binary relations