Zero-term rank inequalities and their extreme preservers | Zendy

Seok-Zun Song | Zendy; Seong-Hee Heo | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Zero-term rank inequalities and their extreme preservers

Author(s) -

Seok-Zun Song,

Seong-Hee Heo

Publication year - 2014

Publication title -

filomat

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.449

H-Index - 34

eISSN - 2406-0933

pISSN - 0354-5180

DOI - 10.2298/fil1409827s

Subject(s) - mathematics , zero (linguistics) , rank (graph theory) , term (time) , combinatorics , matrix (chemical analysis) , row , semiring , pure mathematics , discrete mathematics , philosophy , linguistics , physics , materials science , quantum mechanics , database , computer science , composite material

The zero-term rank of a matrix A over a semiring S is the least number of lines (rows or columns) needed to include all the zero entries in A. In this paper, we characterize linear operators that preserve the sets of matrix ordered pairs which satisfy extremal properties with respect to zero-term rank inequalities of matrices over nonbinary Boolean algebras.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research