Sign patterns that require $\mathbb{H}_n$ exist for each $n\geq 4$
Combinatorics
2017-10-26 v1
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 , which resolves this conjecture.
Keywords
Cite
@article{arxiv.1710.08955,
title = {Sign patterns that require $\mathbb{H}_n$ exist for each $n\geq 4$},
author = {Wei Gao and Zhongshan Li and Lihua Zhang},
journal= {arXiv preprint arXiv:1710.08955},
year = {2017}
}