Sign patterns that require \(\mathbb{H}_n\) exist for each \(n\geq 4\)

DOI10.1016/J.LAA.2015.09.050zbMath1327.15064arXiv1710.08955OpenAlexW2173075660MaRDI QIDQ891522

Wei Gao, Zhongshan Li, Li-Hua Zhang

Publication date: 17 November 2015

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

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

zbMATH Keywords

eigenvaluessign patternrefined inertia

Mathematics Subject Classification ID

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

Related Items (10)

Characterization of star sign patterns that require \(\mathbb{H}_n\) ⋮ Unnamed Item ⋮ Sign Pattern Matrices ⋮ Path sign patterns of order \(n\geq 5\) do not require \(\mathbb{H}_n\) ⋮ Zero-nonzero tree patterns that allow Sn∗ ⋮ Sign pattern matrices that allow inertia \(\mathbb{S}_n\) ⋮ Zero-nonzero patterns of order \(n\geq 4\) do not require \(\mathbb{H}_n^\ast\) ⋮ Sets of refined inertias of zero-nonzero patterns ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Refined inertias of tree sign patterns of orders 2 and 3
• Critical sets of refined inertias for irreducible zero-nonzero patterns of orders 2 and 3
• Sign patterns that require or allow particular refined inertias
• The minimal critical sets of refined inertias for \(3 \times 3\) full sign patterns
• A note on sign patterns of order 3 that require particular refined inertias
• Refined inertially and spectrally arbitrary zero-nonzero patterns
• Refined inertias of tree sign-patterns

This page was built for publication: Sign patterns that require \(\mathbb{H}_n\) exist for each \(n\geq 4\)