Positive matrix semigroups with binary diagonals (Q655978)

The authors show that a semigroup \({\mathcal{S}}\) of positive matrices (all entries greater than or equal to zero) with binary diagonals (diagonal entries either 0 or 1) is either decomposable (all matrices in the semigroup have a common zero entry) or is similar, via a positive diagonal matrix, to a binary semigroup (all entries 0 or 1). In the case where the idempotents of minimal rank in \({\mathcal{S}}\) satisfy a ``diagonal disjointness'' condition, they obtain additional structural information. In the case where the semigroup is not necessarily positive but has binary diagonals they show that either the semigroup is reducible or the minimal rank ideal is a binary semigroup. They also give generalizations of these results to operators acting on the Hilbert space of square-summable sequences.