AbstractCharacterizations are obtained of those linear operators on the m × n matrices over an arbitrary semiring that preserve term rank. We also present characterizations of permanent and rook-polynomial preserving operators on matrices over certain types of semirings. Our results apply to many combinatorially interesting algebraic systems, including nonnegative integer matrices, matrices over Boolean algebras, and fuzzy matrices
AbstractAnalogues of characterizations of rank-preserving operators on field-valued matrices are det...
AbstractWe investigate linear operators which map certain types of tournaments to themselves. To thi...
Abstract. The zero-term rank of a matrix A over a semiringS is the least number of lines (rows or co...
AbstractCharacterizations are obtained of those linear operators over certain semirings that preserv...
AbstractCharacterizations are obtained of those linear operators over certain semirings that preserv...
We characterized the group of linear operators that strongly preserve r-potent matrices over the bin...
AbstractThe term rank of a matrix A over a semiring S is the least number of lines (rows or columns)...
In this paper we obtain some characterizations of linear operators that preserve term rank of Boolea...
AbstractThe term rank of an n×n matrix A is the least number of lines (rows or columns) needed to in...
AbstractThe term rank of a matrix A over a semiring S is the least number of lines (rows or columns)...
In this article, we introduce another standard form of linear preservers. This new standard form pro...
We investigate linear operators which map certain types of tournaments to themselves. To this end we...
We investigate linear operators which map certain types of tournaments to themselves. To this end we...
An m×n matrix A over a semiring S is called regular if there is an n×m matrix G over S such that AGA...
AbstractAn m×n matrix A over a semiring S is called regular if there is an n×m matrix G over S such ...
AbstractAnalogues of characterizations of rank-preserving operators on field-valued matrices are det...
AbstractWe investigate linear operators which map certain types of tournaments to themselves. To thi...
Abstract. The zero-term rank of a matrix A over a semiringS is the least number of lines (rows or co...
AbstractCharacterizations are obtained of those linear operators over certain semirings that preserv...
AbstractCharacterizations are obtained of those linear operators over certain semirings that preserv...
We characterized the group of linear operators that strongly preserve r-potent matrices over the bin...
AbstractThe term rank of a matrix A over a semiring S is the least number of lines (rows or columns)...
In this paper we obtain some characterizations of linear operators that preserve term rank of Boolea...
AbstractThe term rank of an n×n matrix A is the least number of lines (rows or columns) needed to in...
AbstractThe term rank of a matrix A over a semiring S is the least number of lines (rows or columns)...
In this article, we introduce another standard form of linear preservers. This new standard form pro...
We investigate linear operators which map certain types of tournaments to themselves. To this end we...
We investigate linear operators which map certain types of tournaments to themselves. To this end we...
An m×n matrix A over a semiring S is called regular if there is an n×m matrix G over S such that AGA...
AbstractAn m×n matrix A over a semiring S is called regular if there is an n×m matrix G over S such ...
AbstractAnalogues of characterizations of rank-preserving operators on field-valued matrices are det...
AbstractWe investigate linear operators which map certain types of tournaments to themselves. To thi...
Abstract. The zero-term rank of a matrix A over a semiringS is the least number of lines (rows or co...
DOI
Add to ORKG