Sign patterns that require H_n exist for each n 4

DOI10.1016/J.LAA.2015.09.050MaRDI QIDQ891522zbMATH OpenOpenAlexFDO

Authors 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)

Abstract: The refined inertia of a square real matrix $A$ is the ordered $4$-tuple $(n_{+},n_{-},n_z,2n_p)$, where $n_{+}$ (resp., $n_{-}$) is the number of eigenvalues of $A$ with positive (resp., negative) real part, $n_z$ is the number of zero eigenvalues of $A$, and $2n_p$ is the number of nonzero pure imaginary eigenvalues of $A$. For $ngeq3$, the set of refined inertias $mathbb{H}_n=(0,n,0,0),(0,n-2,0,2),(2,n-2,0,0)$ is important for the onset of Hopf bifurcation in dynamical systems. We say that an $nimesn$ sign pattern $calA$ requires $mathbb{H}_n$ if $mathbb{H}_n=extri(B)|BinQ(calA)$. Bodine et al. conjectured that no $nimesn$ irreducible sign pattern that requires $mathbb{H}_n$ exists for $n$ sufficiently large, possibly $nge8$. However, for each $ngeq4$, we identify three $nimesn$ irreducible sign patterns that require $mathbb{H}_n$, which resolves this conjecture.

Recommendations

• Characterization of star sign patterns that require \(\mathbb{H}_n\)
• Path sign patterns of order \(n\geq 5\) do not require \(\mathbb{H}_n\)
• Sign patterns that require or allow particular refined inertias
• Refined inertias of tree sign-patterns
• A note on sign patterns of order 3 that require particular refined inertias

Cites work

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

Cited in

(13)

• Characterization of star sign patterns that require \(\mathbb{H}_n\)
• Sign patterns that require or allow particular refined inertias
• Sign pattern matrices
• Inertia sets allowed by matrix patterns
• Zero-nonzero patterns that allow or require an inertia set related to dynamical systems
• Path sign patterns of order \(n\geq 5\) do not require \(\mathbb{H}_n\)
• Zero-nonzero patterns of order \(n\geq 4\) do not require \(\mathbb{H}_n^\ast\)
• Refined inertias of tree sign-patterns
• Relations between classes of potentially stable sign patterns
• Sets of refined inertias of zero-nonzero patterns
• Using sign patterns to detect the possibility of periodicity in biological systems
• Sign pattern matrices that allow inertia \(\mathbb{S}_n\)
• Zero-nonzero tree patterns that allow Sn∗

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891522)