Matrices Totally Positive Relative to a Tree

zbMATH Open1171.15021arXiv0710.1366MaRDI QIDQ3394466FDOQ3394466

Authors: Charles R. Johnson, Boris Tadchiev, Roberto S. Costas-Santos 

Publication date: 7 September 2009

Abstract: It is known that for a totally positive (TP) matrix, the eigenvalues are positive and distinct and the eigenvector associated with the smallest eigenvalue is totally nonzero and has an alternating sign pattern. Here, a certain weakening of the TP hypothesis is shown to yield a similar conclusion.

Full work available at URL: https://arxiv.org/abs/0710.1366

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Matrices totally positive relative to a tree. II.
• Weak interlacing properties of totally positive matrices
• On the Relationship Between Graphs and Totally Positive Matrices
• Spectral structures of irreducible totally nonnegative matrices
• Interlacing inequalities for totally nonnegative matrices

zbMATH Keywords

eigenvaluesgraph theoryeigenvectorspectral theorySylvester's identitytotally positive matrices

Mathematics Subject Classification ID

Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48)

Cited In (4)

• Matrices totally positive relative to a tree. II.
• Eigenvalue localization for totally positive matrices
• Title not available (Why is that?)
• On the adjoint of a matrix associated with trees

This page was built for publication: Matrices Totally Positive Relative to a Tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394466)