Term-rank, permanent, and rook-polynomial preservers

From MaRDI portal
Publication:1821840





The term-rank is the least \(x+y\) such that x rows and y columns cover all nonzero entries in a matrix. The authors show that linear transformations over any semiring preserve term-rank if and only if they are compositions of permutations of rows and columns, transpose, and entrywise multiplication by another matrix. They obtain a similar characterization of transformations preserving permanent.




Cited in
(28)








This page was built for publication: Term-rank, permanent, and rook-polynomial preservers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1821840)