Term-rank, permanent, and rook-polynomial preservers (Q1821840)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4000122
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Term-rank, permanent, and rook-polynomial preservers |
scientific article; zbMATH DE number 4000122 |
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
0.8824427
0 references
0.8573315
0 references
0.8550105
0 references
0.85393465
0 references
0.8472832
0 references
0.8464755
0 references
0.8454051
0 references
0.8453764
0 references
