On Fiedler's characterization of tridiagonal matrices over arbitrary fields

DOI10.1016/j.laa.2005.01.026zbMath1074.15030OpenAlexW1995605974MaRDI QIDQ1779413

Américo Bento, António Leal-Duarte

Publication date: 1 June 2005

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10316/11425

zbMATH Keywords

finite fieldssimilarityrankcompletion problemFiedler propertytridiagonal \(5\times 5\)-matrices

Mathematics Subject Classification ID

Matrices over special rings (quaternions, finite fields, etc.) (15B33) Inverse problems in linear algebra (15A29) Hermitian, skew-Hermitian, and related matrices (15B57) Canonical forms, reductions, classification (15A21)

Related Items (5)

The minimum rank of symmetric matrices described by a graph: a survey ⋮ The minimum rank problem over the finite field of order 2: Minimum rank 3 ⋮ The graphs for which the maximum multiplicity of an eigenvalue is two ⋮ On the minimum rank of a graph over finite fields ⋮ On symmetric matrices with indeterminate leading diagonals

Cites Work

• On a characterization of tridiagonal matrices by M. Fiedler
• A characterization of tridiagonal matrices
• Graph theoretic methods for matrix completion problems
• Unnamed Item

This page was built for publication: On Fiedler's characterization of tridiagonal matrices over arbitrary fields