Positive matrix semigroups with binary diagonals |
| |
Authors: | L Livshits G MacDonald H Radjavi |
| |
Institution: | 1.Department of Mathematics,Colby College,Waterville,USA;2.Department of Mathematics and Statistics,University of Prince,Edward Island,Canada;3.Department of Pure Mathematics,University of Waterloo,Waterloo,Canada |
| |
Abstract: | We show that a semigroup 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 S{\mathcal{S}} satisfy a “diagonal disjointness” condition, we obtain additional structural information. In the case where the semigroup
is not necessarily positive but has binary diagonals we show that either the semigroup is reducible or the minimal rank ideal
is a binary semigroup. We also give generalizations of these results to operators acting on the Hilbert space of square-summable
sequences. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|