Abstract
The term rank of an n×n matrix A is the least number of lines (rows or columns) needed to include all the nonzero entries in A. In this paper, we study linear operators that preserve term ranks of n×n symmetric matrices with entries in a commutative antinegative semiring § and with all diagonal entries zero. Consequently, we show that a linear operator T on symmetric matrices with zero diagonal preserves term rank if and only if T preserves term ranks 2 and k(≥3) if and only if T preserves term ranks 3 and k(≥4). Other characterizations of term-rank preservers are also given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
