A combinatorial converse to the Perron-Frobenius theorem
From MaRDI portal
Publication:1813899
DOI10.1016/0024-3795(90)90026-9zbMATH Open0739.15004OpenAlexW2037030461MaRDI QIDQ1813899FDOQ1813899
Authors: Carolyn A. Eschenbach, Charles R. Johnson
Publication date: 25 June 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(90)90026-9
Recommendations
Cites Work
Cited In (21)
- Ray pattern matrices requiring Perron-Frobenius properties
- A combination theorem for \(PD(n)\)-pairs
- On the inertia sets of some symmetric sign patterns
- A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture
- Nested sequences of principal minors and potential stability
- Allow problems concerning spectral properties of sign pattern matrices: a survey
- Perron-Frobenius theorem for matrices with some negative entries
- On the Perron-Frobenius theory of \(M_v\)-matrices and equivalent properties to eventually exponentially nonnegative matrices
- A combinatorial proof of a theorem of Freund
- From real to complex sign pattern matrices
- Sign pattern matrices that admit \(P_{0}\)-matrices
- Relations between Perron-Frobenius results for matrix pencils
- On matrices with cyclic structure
- Two characterizations of matrices with the Perron-Frobenius property
- Linear operators strongly preserving matrices whose sign patterns require the Perron property
- Sign patterns that require real, nonreal or pure imaginary eigenvalues
- Conditions for the positivity of determinants
- The structure of tripotent sign pattern matrices
- Idempotence for sign-pattern matrices
- Sign-patterns which require a positive eigenvalue
- Title not available (Why is that?)
This page was built for publication: A combinatorial converse to the Perron-Frobenius theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1813899)