Generating potentially nilpotent full sign patterns

DOI10.13001/1081-3810.1302zbMath1181.15039OpenAlexW2119055371MaRDI QIDQ3394470

Kevin N. Vander Meulen, Hein van der Holst, In-Jae Kim, D. Dale Olesky, Bryan L. Shader, Pauline van den Driessche

Publication date: 7 September 2009

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117628

zbMATH Keywords

inertiasign patternpotentially nilpotentspectrally arbitrarymatrix patternpotentially stable

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Sign pattern matrices (15B35)

Related Items (16)

Using sign patterns to detect the possibility of periodicity in biological systems ⋮ A mathematical analysis of an activator-inhibitor Rho GTPase model ⋮ Refined inertias of strongly connected orientations of the Petersen graph ⋮ The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph ⋮ Unnamed Item ⋮ Sign Pattern Matrices ⋮ Bordering for spectrally arbitrary sign patterns ⋮ Counterexamples on spectra of sign patterns ⋮ Constructions for potentially stable sign patterns ⋮ Critical sets of refined inertias for irreducible zero-nonzero patterns of orders 2 and 3 ⋮ Sign patterns that require or allow particular refined inertias ⋮ Polynomial stability and potentially stable patterns ⋮ 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

This page was built for publication: Generating potentially nilpotent full sign patterns