Linear operators strongly preserving matrices whose sign patterns require the Perron property (Q1375517): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Term-rank, permanent, and rook-polynomial preservers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear operators strongly preserving digraphs whose maximum cycle length / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4009969 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A combinatorial converse to the Perron-Frobenius theorem / rank | |||
Normal rank |
Latest revision as of 09:06, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear operators strongly preserving matrices whose sign patterns require the Perron property |
scientific article |
Statements
Linear operators strongly preserving matrices whose sign patterns require the Perron property (English)
0 references
6 January 1998
0 references
A sign-pattern matrix of \(B\) requires the Perron property if every real matrix in the sign-pattern class of \(B\) satisfies the Perron property. This paper characterizes the linear operators that strongly preserve matrices whose sign patterns require the Perron property. It is shown that any such linear operator is nonsingular and can be written as the direct sum of two linear operators, the first acting on diagonal matrices and the second acting on matrices with diagonal entries all zero.
0 references
cycle
0 references
signature
0 references
permutation
0 references
positive eigenvalue
0 references
sign-pattern matrix
0 references
Perron property
0 references