2009
DOI: 10.1137/080718838
|View full text |Cite
|
Sign up to set email alerts
|

Determinant Expansions of Signed Matrices and of Certain Jacobians

Abstract: This paper treats two topics: matrices with sign patterns and Jacobians of certain mappings. The main topic is counting the number of plus and minus coefficients in the determinant expansion of sign patterns and of these Jacobians. The paper is motivated by an approach to chemical networks initiated by Craciun and Feinberg. We also give a graph-theoretic test for determining when the Jacobian of a chemical reaction dynamics has a sign pattern.Comment: 25 page

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
20
0

Year Published

2009
2009
2018
2018

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(21 citation statements)
references
References 18 publications
1
20
0
Order By: Relevance
“…To prove the converse, first note that we have that v(ρ cv ) = (S ⊥ b ) Tṽ (ρ cv ) verifies v(ρ cv ) T S b = 0 and v(ρ cv ) > 0 for all ρ cv ∈ P cv . This proves the equality and the first inequality in (25). Observe now that for any ρ u ∈ P u , there exists a nonnegative matrix ∆…”
Section: Bimolecular Networksupporting
confidence: 54%
See 1 more Smart Citation
“…To prove the converse, first note that we have that v(ρ cv ) = (S ⊥ b ) Tṽ (ρ cv ) verifies v(ρ cv ) T S b = 0 and v(ρ cv ) > 0 for all ρ cv ∈ P cv . This proves the equality and the first inequality in (25). Observe now that for any ρ u ∈ P u , there exists a nonnegative matrix ∆…”
Section: Bimolecular Networksupporting
confidence: 54%
“…Sign-matrices have also been considered in the context of reaction networks, albeit much more sporadically; see e.g. [1,23,[25][26][27][28]. In this case, again, the conditions obtained in [1,27] can be stated as a very simple linear program that can be shown to be equivalent to some graph theoretical conditions.…”
Section: Introductionmentioning
confidence: 99%
“…Note that the only situation that is not covered by Theorem 1 is when sign(det(M (x))) takes the value 0 for some x, but never the value (−1) s+1 . The determinant of M (x) is the same as the core determinant in [30,Lemma 3.7]. See also [10,Remark 9.27].…”
Section: Equilibriamentioning
confidence: 99%
“…For mass-action systems, conditions that exclude the possibility of degenerate equilibria are described in [14]. For non-mass-action systems such conditions are described in [16,25].…”
Section: The Main Resultsmentioning
confidence: 99%