Idempotent Boolean matrices
From MaRDI portal
Publication:1147203
DOI10.1007/BF02572554zbMath0449.16010OpenAlexW2029141647MaRDI QIDQ1147203
Publication date: 1980
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/134452
Endomorphism rings; matrix rings (16S50) Semigroups of transformations, relations, partitions, etc. (20M20) Conditions on elements (16U99) Semirings (16Y60)
Related Items (6)
Semigroups generated by partitions ⋮ Idempotent Boolean matrices and majorization ⋮ Power convergent Boolean matrices ⋮ A proof of Devadze's theorem on generators of the semigroup of Boolean matrices. ⋮ Unnamed Item ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)
Cites Work
- Finite binary relations have no more complexity than finite functions
- The number of partially ordered sets
- The number of idempotents in (0,1)-matrix semigroups
- Cardinalities of \(D\)-classes in B\(_n\)
- Idempotents and product representations with applications to the semigroup of binary relations
- Asymptotic Enumeration of Partial Orders on a Finite Set
- The Number of Finite Topologies
- On the semigroup of binary relations
This page was built for publication: Idempotent Boolean matrices
