Nonnegative rank-preserving operators (Q2266048): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Boolean-rank-preserving operators and Boolean-rank-1 spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5840217 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3958592 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear transformations on matrices: rank preservers and determinant preservers (Note) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear transformations on matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Transformations on Algebras of Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations on tensor product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear transformations on matrices: rank 1 preservers and determinant preservers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-negative matrices and Markov chains. 2nd ed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations on tensor spaces / rank
 
Normal rank

Latest revision as of 16:14, 14 June 2024

scientific article
Language Label Description Also known as
English
Nonnegative rank-preserving operators
scientific article

    Statements

    Nonnegative rank-preserving operators (English)
    0 references
    1985
    0 references
    A nonnegative semidomain S is a subset of the nonnegative real numbers which contains 0, 1, and which is closed under addition and multiplication. The authors consider the set of \(m\times n\) matrices with entries in S and transformations T which satisfy a ''linearity'' condition \(T(\alpha x+\beta y)=\alpha Tx+\beta Ty\) except of course \(\alpha\), \(\beta\in S\). If x is an \(m\times n\) matrix with entries from S then the rank of x is the least integer k for which x has a factorization \(x=yz\) where y is \(m\times k\) and z is \(k\times n\) (both y and z have entries from S). A major result is that if T is a linear operator on the \(m\times n\) matrices over S where min(m,n)\(\geq 4\) then T preserves ranks if and only if T preserves ranks 1, 2, and 4.
    0 references
    field-valued matrices
    0 references
    nonnegative
    0 references
    rank preserving operators
    0 references
    nonnegative semidomain
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references