Minimum number of non-zero-entries in a \(7 \times 7\) stable matrix (Q2419028): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2962914640 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1805.09004 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998725 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructions for potentially stable sign patterns / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nested sequences of principal minors and potential stability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The potentially stable tree sign patterns for dimensions less than five / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Qualitative Problems in Matrix Theory / rank | |||
Normal rank |
Latest revision as of 10:37, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimum number of non-zero-entries in a \(7 \times 7\) stable matrix |
scientific article |
Statements
Minimum number of non-zero-entries in a \(7 \times 7\) stable matrix (English)
0 references
29 May 2019
0 references
It is known that if a sign pattern matrix of order $n < 7$ is potentially stable, then it has at most 10 nonzero entries. The purpose of the present paper is to extend these results to such matrix of order 7 by showing it has at least 11 nonzero entries. The paper also determines the minimum number of edges in a strongly connected digraph depending on its circumference. To this end, the authors first construct a list of all digraphs with 7 vertices and 10 edges allowing for correct minors, and then generate the associated set of nonequivalent matrix sign patterns having correct minors. Finally, they use a variant of the Routh-Hurwitz stability criterion to show that none of these candidate sign patterns have a stable realization, thereby concluding that the minimum number of nonzero entries must be equal to 11.
0 references
stable matrices
0 references
directed graphs
0 references
Routh-Hurwitz stability criterion
0 references