Term-rank, permanent, and rook-polynomial preservers (Q1821840): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:47, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Term-rank, permanent, and rook-polynomial preservers |
scientific article |
Statements
Term-rank, permanent, and rook-polynomial preservers (English)
0 references
1987
0 references
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.
0 references
term-rank preserving transformation
0 references
rook-polynomial preserving operators
0 references
semirings
0 references
nonnegative integer matrices
0 references
fuzzy matrices
0 references
linear transformations
0 references
permanent
0 references
