Zero-nonzero patterns of order \(n\geq 4\) do not require \(\mathbb{H}_n^\ast\)

DOI10.1016/j.laa.2018.05.015zbMath1393.15042OpenAlexW2804842116MaRDI QIDQ725500

D. Kharzeev

Publication date: 1 August 2018

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

Full work available at URL: https://doi.org/10.1016/j.laa.2018.05.015

zbMATH Keywords

digrapheigenvaluesrefined inertiazero-nonzero pattern

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Directed graphs (digraphs), tournaments (05C20) Sign pattern matrices (15B35)

Related Items (2)

Zero-nonzero tree patterns that allow Sn∗ ⋮ Unnamed Item

Cites Work

• Characterization of star sign patterns that require \(\mathbb{H}_n\)
• Sign patterns that require or allow particular refined inertias
• Sets of refined inertias of zero-nonzero patterns
• Sign patterns that require \(\mathbb{H}_n\) exist for each \(n\geq 4\)
• The minimal critical sets of refined inertias for \(3 \times 3\) full sign patterns
• Path sign patterns of order \(n\geq 5\) do not require \(\mathbb{H}_n\)
• Generating potentially nilpotent full sign patterns
• Matrix Analysis
• Refined inertias of tree sign-patterns

This page was built for publication: Zero-nonzero patterns of order \(n\geq 4\) do not require \(\mathbb{H}_n^\ast\)