We first characterize square idempotent zero-nonzero patterns with elements from $\{0, \ast\}$. To identify these matrices, we convert this problem into characterizing square binary idempotent matrices over the real numbers. Next we determine maximal possible number of nonzero entries in indempotent zero-nonzero pattern with a given minimum rank.
|