2002
DOI: 10.1016/s0024-3795(02)00293-8
|View full text |Cite
|
Sign up to set email alerts
|

Linear operators that preserve pairs of matrices which satisfy extreme rank properties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
17
0

Year Published

2004
2004
2017
2017

Publication Types

Select...
8

Relationship

3
5

Authors

Journals

citations
Cited by 22 publications
(17 citation statements)
references
References 3 publications
0
17
0
Order By: Relevance
“…Let S be any semiring. An operator T : M m,n (S) → M m,n (S) is called a (P, Q, B)-operator if there exist permutation matrices P and Q, and a matrix B ∈ M m,n (S) with no zero entries, such that In [4] linear preservers of extremal cases of classical matrix inequalities over fields were characterized. On the other hand, linear preservers for various rank functions over semirings have been the object of much study during the last 30 years, see for example [2]- [12].…”
Section: Definition 23mentioning
confidence: 99%
See 1 more Smart Citation
“…Let S be any semiring. An operator T : M m,n (S) → M m,n (S) is called a (P, Q, B)-operator if there exist permutation matrices P and Q, and a matrix B ∈ M m,n (S) with no zero entries, such that In [4] linear preservers of extremal cases of classical matrix inequalities over fields were characterized. On the other hand, linear preservers for various rank functions over semirings have been the object of much study during the last 30 years, see for example [2]- [12].…”
Section: Definition 23mentioning
confidence: 99%
“…The investigation of the corresponding problems over semirings for the column rank function was done in [3]. The complete classification of linear operators that preserve equality cases in matrix inequalities over fields was obtained in [4]. For details on linear operators preserving matrix invariants one can see [9] and [10].…”
Section: Introductionmentioning
confidence: 99%
“…If (1.1) holds, then we say that φ preserves the additivity of rank, or we say that φ preserves pairs x, y satisfying extreme rank properties (as in [4] and [16]). It was shown in [9] that the above condition is equivalent to preserving the substractivity of rank.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, Beasley and his colleagues investigated rank inequalities of matrices over semirings ( [1]) and characterized the linear operators that preserve extreme set of matrix pairs for rank inequality cases ( [2] and [3]). This research extends the linear preserver problems to the set of matrix pairs from the set of single matrices.…”
Section: Introductionmentioning
confidence: 99%