Sign patterns that require $\mathbb{H}_n$ exist for each $n\geq 4$
Wei Gao, Zhongshan Li, Lihua Zhang

TL;DR
This paper proves that for all $n \\geq 4$, there exist specific irreducible sign patterns of matrices that necessarily have refined inertia sets associated with Hopf bifurcation, countering previous conjectures.
Contribution
The authors identify three irreducible sign patterns for each $n \\geq 4$ that require the refined inertia set $\\mathbb{H}_n$, thus disproving a prior conjecture.
Findings
Existence of $n \\geq 4$ irreducible sign patterns requiring $\\mathbb{H}_n$
Counterexample to Bodine et al.'s conjecture for all $n \\geq 4$
Resolution of the conjecture about sign patterns and refined inertia sets
Abstract
The refined inertia of a square real matrix is the ordered -tuple , where (resp., ) is the number of eigenvalues of with positive (resp., negative) real part, is the number of zero eigenvalues of , and is the number of nonzero pure imaginary eigenvalues of . For , the set of refined inertias is important for the onset of Hopf bifurcation in dynamical systems. We say that an sign pattern requires if . Bodine et al. conjectured that no irreducible sign pattern that requires exists for sufficiently large, possibly . However, for each , we identify three irreducible sign patterns that require ,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · graph theory and CDMA systems · Advanced Graph Theory Research
