Term-rank, permanent, and rook-polynomial preservers (Q1821840): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0024-3795(87)90302-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2037645984 / rank | |||
Normal rank | |||
Revision as of 01:25, 20 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
