## Semiring rank versus column rank.(English)Zbl 0642.15002

For matrices over a semiring (Schein) rank, row rank, and column rank can all be different. The authors compute the largest rank, such that for all matrices of at most that rank, rank, row rank, and column rank are all equal for specified matrix sizes for many semirings including Boolean, fuzzy, $$Q^+$$, $$Z^+$$.
Reviewer: K.H.Kim

### MSC:

 15B33 Matrices over special rings (quaternions, finite fields, etc.) 15B48 Positive matrices and their generalizations; cones of matrices 15A03 Vector spaces, linear dependence, rank, lineability 20M20 Semigroups of transformations, relations, partitions, etc.

### Keywords:

Schein rank; matrix over semiring; row rank; column rank
Full Text:

### References:

 [1] Beasley, L.B.; Pullman, N.J., Fuzzy rank-preserving operators, Linear algebra appl., 73, 197-211, (1986) · Zbl 0578.15002 [2] Cao, Z-Q.; Kim, K.H.; Roush, F.W., Incline algebra and applications, (1984), Wiley New York · Zbl 0541.06009 [3] de Caen, D.; Gregory, D.A., Primes in the semigroup of Boolean matrices, Linear algebra appl., 37, 119-134, (1981) · Zbl 0457.05001 [4] Gregory, D.A.; Pullman, N.J., Semiring rank: Boolean rank and nonnegative rank factorizations, J. combin. inform. system sci., 8, 223-233, (1983) · Zbl 0622.15007 [5] Kim, K.H., Boolean matrix theory and applications, () [6] Rao, K.; Rao, P., On generalized inverses of Boolean matrices, Linear algebra appl., 11, 135-153, (1975) · Zbl 0322.15011 [7] Rao, K.; Rao, P., On generalized inverses of Boolean matrices. II, Linear algebra appl., 42, 133-144, (1982) · Zbl 0479.15003 [8] Richman, D.J.; Schneider, H., Primes in the semigroup of nonnegative matrices, Linear and multilinear algebra, 2, 135-140, (1974)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.