Idempotent Boolean matrices
From MaRDI portal
Cites work
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Cardinalities of \(D\)-classes in B\(_n\)
- Finite binary relations have no more complexity than finite functions
- Idempotents and product representations with applications to the semigroup of binary relations
- On the semigroup of binary relations
- The Number of Finite Topologies
- The number of idempotents in (0,1)-matrix semigroups
- The number of partially ordered sets
Cited in
(6)- Power convergent Boolean matrices
- Combinatorial analysis (nonnegative matrices, algorithmic problems)
- scientific article; zbMATH DE number 7311628 (Why is no real title available?)
- A proof of Devadze's theorem on generators of the semigroup of Boolean matrices.
- Idempotent Boolean matrices and majorization
- Semigroups generated by partitions
This page was built for publication: Idempotent Boolean matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1147203)