Abstract
Identifying and classifying the potentially eventually positive sign patterns and the potentially eventually exponentially positive sign patterns of orders greater than 3 have been raised as two open problems since 2010. In this article, we investigate the potential eventual positivity of the class of double star-like sign patterns whose underlying graph is obtained from the underlying graph of the -by- double star sign patterns by adding an additional vertex adjacent to the two center vertices and removing the edge between the center vertices. We firstly establish some necessary conditions for a double star-like sign pattern to be potentially eventually positive, and then identify all the minimal potentially eventually positive double star-like sign patterns. Secondly, we classify all the potentially eventually positive sign patterns in the class of double star-like sign patterns . Finally, as an application of our results about the potentially eventually positive double star-like sign patterns, we identify all the minimal potentially eventually exponentially positive sign patterns and characterize all the potentially eventually exponentially positive sign patterns in the class of double star-like sign patterns .
Keywords:
sign pattern; double star-like sign pattern; primitive digraph; eventually positive matrix; eventually exponentially positive matrix MSC:
15A48; 15A18; 05C50
1. Introduction
The study of combinatorial and qualitative information, which is only related to the signs of its entries and independent of the magnitudes of its entries of a real matrix, has attracted great attention. A sign pattern is a matrix whose entries belong to the set . A real matrix with the sign of being the same as for all i and j is called a realization of . The set of all realizations of sign pattern is denoted by , and is called the qualitative class of ; see [1] for example. An n-by-n sign pattern is a subpattern of if whenever . If is a subpattern of and , then is a proper subpattern of . If is a subpattern of , then is said to be a superpattern of . A sign pattern is reducible if there is a permutation matrix such that
where and are square matrices of order at least one. A sign pattern is irreducible if it is not reducible; see [2,3] for more details.
An n-by-n real matrix A is said to be eventually positive if there exists a positive integer , such that for all ; see [4,5] for example. Eventually positive matrices have been widely applied into the system of linear differential equations (, , ) whose solutions become positive at finite time and remain positive for all time thereafter; see, for example, [6]. An n-by-n sign pattern is said to be potentially eventually positive (PEP) if there exists some eventually positive matrices in the qualitative class of . PEP sign patterns are studied first by Berman et al. [7], in which some sufficient conditions and some necessary conditions for an arbitrary sign pattern to be PEP are established, and all the PEP sign patterns of small orders (≤3) are classified. However, the identification and classification of PEP sign patterns of orders greater than 3 have not been solved since 2010. To classify the PEP sign patterns, [8] introduced the minimal potentially eventually positive sign pattern. Recall that an n-by-n sign pattern is said to be a minimal potentially eventually positive sign pattern (MPEP), if is PEP and everyproper subpattern of is not PEP.
An n-by-n sign pattern is said to be potentially eventually exponentially positive (PEEP), if there exists some such that A is eventually exponentially positive. PEEP sign patterns were studied first in [9], where some sufficient or necessary conditions for PEEP sign patterns were established. However, as stated in [9], there are many open problems about the PEEP sign patterns. For example, identifying and classifying the PEEP sign patterns of orders greater than 3 were posed as open problems. To classify the PEEP sign patterns, the MPEEP sign patterns were introduced naturally in [10]. Recall that an n-by-n sign pattern is said to be a minimal potentially eventually exponentially positive sign pattern (MPEEP), if is PEEP and every proper subpattern of is not PEEP.
In the last few years, there has been an increasing interest in potentially eventual positivity of sign patterns, see [11,12,13,14,15]. Notably, the PEP sign patterns and PEEP sign patterns with some special graph structures have been identified and classified, such as the star sign patterns, the double star sign patterns, the Broom sign patterns, etc. However, there is no literature that studies the potential eventual (exponential) positivity of sign patterns obtained by some graph operations from the known PEP (PEEP) sign patterns.
In this article, we investigate the potential eventual positivity of the class of double star-like sign patterns whose underlying graph is obtained from the underlying graph of the -by- double star sign patterns by adding an additional vertex adjacent to the two center vertices, and removing the edge between these center vertices. We first establish some necessary conditions for a double star-like sign pattern to be PEP, and then identify all the MPEP sign patterns in the class of double star-like sign patterns , and consequently we classify all the PEP sign patterns in the class of double star-like sign patterns . As an application of our results, we identify all the MPEEP sign patterns and classify all the PEEP sign patterns in the class of double star-like patterns .
2. Eventual Positivity of the Double Star-like Sign Patterns
We begin this section by introducing some necessary graph theoretical concepts which can be found in [2,4], and the references therein. A square sign pattern is combinatorially symmetric if whenever . Let be the graph of order n with vertices and an edge joining vertices i and j if and only if and . We call the graph of the sign pattern . A combinatorially symmetric sign pattern matrix is called a double star (respectively, star, Broom) sign pattern if is a double star (respectively, star, Broom) graph. A sign pattern has signed digraph with vertex set and a positive (respectively, negative) arc from i to j if and only if is positive (respectively, negative). A (directed) simple cycle of length k is a sequence of k arcs such that the vertices are distinct. Recall that a digraph D is primitive if it is strongly connected and the greatest common divisor of the lengths of its simple cycles is 1. It is well known that a digraph D is primitive if and only if there exists a natural number k such that for all vertices i and j, there is a walk of length k from vertex i to vertex j. A nonnegative sign pattern is primitive if its signed digraph is primitive; see, e.g., [7] for more details.
For a sign pattern , the positive part of is defined to be , where if , and otherwise. The negative part of (denoted by ) is defined similarly. In [7], it is observed that if the sign pattern is primitive, then is PEP. Furthermore, it is shown that if an n-by-n sign pattern is PEP, then every superpattern of is PEP. Following [9], let (respectively, and ) be the sign pattern obtained from sign pattern by changing all diagonal entries to + (respectively, 0 and −), for the readers’ conveniences. Note that is used for in [7], where it is shown that is PEP, if is PEP. For an n-by-n sign pattern to be PEP, the following two results from [7] are very necessary.
Lemma 1
([7]). If an n-by-n sign pattern is PEP, then there is an eventually positive matrix such that
(1) , where is the spectral radius of A.
(2) , where is the all ones vector.
(3) If , the sum of all the off-diagonal entries of A is positive.
To proceed, we denote a sign pattern consisting entirely of positive (respectively, negative) entries by (respectively, ), and let be a square block sign pattern of order i consisting entirely of positive entries. For block sign patterns, we have the following Lemma 2, which is shown in [7].
Lemma 2
([7]). Let be the checkerboard block sign pattern
with square diagonal blocks. Then
- (1)
- −𝒜 is not PEP;
- (2)
- if 𝒜 has a negative entry, then 𝒜 is not PEP.
Now we turn to the double star-like sign patterns . As shown in Figure 1, the graph consists of two stars and , together with one additional vertex adjacent to the center vertices of and .
Figure 1.
The graph of sign pattern .
Note that is a double star sign pattern for or , and is a broom sign pattern for or . The PEP double star sign patterns have been investigated in [8], and the PEP broom sign patterns have been investigated in [15]. Throughout the paper, we assume that and . Clearly, a sign pattern is PEP if and only if or is PEP, for any permutation sign pattern . Without loss of generality, let the -by- double star-like sign pattern be of the following form
where ? denotes an entry from , ∗ denotes a nonzero entry, and the unspecified entries are all zeros.
Now we turn to establish the first necessary condition for the -by- double star-like sign pattern to be PEP.
Theorem 1.
Let be a double star-like sign pattern of order of the form . If is PEP, then is symmetric.
Proof.
Since is PEP, by Lemma 1 there is an eventually positive matrix such that and , where is the all ones vector. Let be a positive left eigenvector corresponding to . Then by , which ensures that for all ,
and for ,
By Equality (1), we deduce that
Then and
Next, we proceed to establish more necessary conditions for an -by- double star-like sign pattern to be PEP.
Lemma 3.
Let be a symmetric double star-like sign pattern of order of the form with and . If there is some with , or some with , then is not PEP.
Proof.
Let s be the number of indices i such that and . Let t be the number of indices j such that and . To complete the proof, the following three cases need to be considered respectively.
Case 1. and .
Up to equivalence,
where , of order s, of order , of order , the 2-by-s matrix , the 2-by- matrix , and the -by- matrix . Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Thus, is not PEP. It follows that is not PEP.
Case 2. and .
Similarly, by permutation similarity, let be of the form in Case 1 with of order t, of order , of order , the 2-by-m matrix , the 2-by- matrix , and the -by- matrix . Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Hence, is not PEP. It follows that is not PEP.
Case 3. and .
Up to equivalence,
where , of order s, of order , of order t, of order , the 2-by-s matrix , the 2-by- matrix , the -by-t matrix , and the -by- matrix Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Thus, is not PEP. It follows that is not PEP. □
Lemma 4.
Let be a symmetric double star-like sign pattern of order of the form with and . If there is some with , or some with , then is not PEP.
Proof.
Let s be the number of indices i such that and . Let t be the number of indices j such that and . To complete the proof, it suffices to consider the following three cases.
Case 1. and .
Up to equivalence, let
where , of order s, of order , , of order , the 2-by-s matrix , the 2-by- matrix , the 2-by-1 matrix , and the 1-by- matrix . Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Thus is not PEP. It follows that is not PEP.
Case 2. and .
By permutation similarity, let be of the form in Case 1 with a minor modification: of order t, of order , of order , the 2-by-t matrix , the 2-by- matrix , and the 1-by- matrix . Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Thus, is not PEP. It follows that is not PEP.
Case 3. and .
Up to equivalence,
where , of order s, of order , , of order t, of order , the 2-by-s matrix , the 2-by- matrix , the 2-by-1 matrix , the 1-by-t matrix , and the 1-by- matrix . Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Thus is not PEP. It follows that is not PEP. □
Lemma 5.
Let be a symmetric double star-like sign pattern of order of the form with and . If there is some with , or some with , then is not PEP.
Proof.
By permutation similarity, the proof is similar to that of Lemma 4. □
Lemma 6.
Let be a symmetric double star-like sign pattern of order of the form with and . If there is some such that , or some such that , then is not PEP.
Proof.
Let s be the number of indices i such that and . Let t be the number of indices j such that and . To complete the proof, the following three cases need to be considered respectively.
Case 1. and .
Up to equivalence, assume
where , of order s, of order , of order , , the 1-by- matrix , the 1-by-s matrix , the 1-by- matrix , and the 1-by- matrix . Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Thus, is not PEP. It follows that is not PEP.
Case 2. and .
Up to equivalence, by permutation similarity, let be of the form in Case 1, where , of order t, of order , of order , , the 1-by- matrix , the 1-by-t matrix , the 1-by- matrix , and the 1-by- matrix . Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Thus, is not PEP. It follows that is not PEP.
Case 3. and .
Up to equivalence,
where , of order s, of order , of order t, of order , , the 1-by- matrix , the 1-by-s matrix , the 1-by- matrix , the 1-by-t matrix , and the 1-by- matrix . Let be a proper superpattern of of the form
By Lemma 2, is not PEP. Thus, is not PEP. It follows that is not PEP. □
Proposition 1.
The double star-like sign pattern
is not PEP.
Proof.
Assume that is PEP. Then and all its superpattern are also PEP. Let
Then is a superpattern of and is PEP. However, is a checkerboard block sign pattern and is not PEP by Lemma 2; a contradiction. □
Proposition 2.
The double star-like sign pattern
is not PEP.
Proof.
Assume that is PEP. Then and all its superpattern are also PEP. Let
Then is a superpattern of and is PEP. However, is a checkerboard block sign pattern and is not PEP by Lemma 2; a contradiction. □
Proposition 3.
The double star-like sign pattern
is not PEP.
Proof.
Assume that is PEP. Then and all its superpattern are also PEP. Let
Then is a superpattern of and is PEP. However, is a checkerboard block sign pattern and is not PEP by Lemma 2; a contradiction. □
For every n-by-n () sign pattern, there is an eventually positive matrix realization with the sum of all nonzero off-diagonal entries being positive. However, for the -by- PEP double star-like sign patterns of the form , the conclusion can be strengthened.
Theorem 2.
Let be an -by- double star-like sign pattern of the form . If is PEP, then , , for all , and for all .
Proof.
Recall that every double star-like sign pattern that is PEP must be symmetric by Theorem 1. Suppose that , . If there is some such that , or some such that , then is not PEP by Lemma 4. Thus for all , and for all , and . However, by Proposition 1 is not PEP; a contradiction.
Suppose that , . If there exists some such that , or some such that , then is not PEP by Lemma 5. Thus for all , and for all , and . However, by Proposition 3 is not PEP; a contradiction.
Suppose that , . If there exists some such that , or some such that , then is not PEP by Lemma 6. Thus for all , and for all , and . However, by Proposition 2, is not PEP; a contradiction.
Consequently, , . If there exists some such that , or some such that , then is not PEP by Lemma 3. If follows that for all , and for all . □
Lemma 7.
Let be an -by- double star-like sign pattern of the form . If is PEP, then there is some such that .
Proof.
Suppose that there is no such that . Since is PEP, is PEP. By Theorem 2, , , for all , and for all . Let
Then is a proper superpattern of and is PEP. However, is a checkerboard block sign pattern and is not PEP by Lemma 2; a contradiction. It follows that there exist some such that . □
Now we proceed to characterize the PEP double star-like sign patterns of the form .
Theorem 3.
Let be an -by- double star-like sign pattern of the form . Then is PEP if and only if , , for all , for all , and there is some such that .
Proof.
The necessity follows from Theorem 2 and Lemma 7. The sufficiency follows from the fact that the positive part of is primitive. □
Next we turn to identifying all the MPEP double star-like sign pattern of the form . To state clearly, let be the -by- double star-like sign pattern of the form such that all nonzero off-diagonal entries are +, and for all . For example,
and
Note that double star-like sign patterns , , …, are equivalent to each other. Similarly, double star-like sign patterns , , …, are equivalent to each other, especially if , then is equivalent to for all .
Proposition 4.
The sign patterns, , , and are MPEP.
Proof.
is PEP for its positive part is primitive. If some nonzero off-diagonal entries of are changed to be 0, then the corresponding sign pattern is not irreducible and thus is not PEP. If the only one positive diagonal entry is changed to be 0, then the corresponding sign pattern is not PEP by Lemma 7. It follows that is MPEP. By a similar discussion, we can show that , , , and are MPEP. □
Theorem 4.
Let be an -by- double star-like sign pattern of the form . If , then is MPEP if and only if is equivalent to one of , , , and . If , then is MPEP if and only if is equivalent to one of , and .
Proof.
It suffices to show the first case. The sufficiency follows from Proposition 4. For the necessity, since is MPEP, by Theorem 2, , , for all , and for all . There is some such that by Lemma 7. If has at least two nonzero diagonal entries, then is a proper superpattern of , , , or , up to equivalence. Since is MPEP, one of , , , and is not PEP, contradicting Proposition 4. Consequently, has exactly one positive diagonal entry. It follows that is equivalent to one of , , , and . □
Note that Theorem 4 indicates that for the class of -by- double star-like sign patterns of the form , if , then there are exactly five MPEP sign patterns, and if , then there are exactly three MPEP sign patterns, up to equivalence. Thus, we identify all the MPEP sign patterns in the class of double star-like sign patterns of the form . Next, it is time to classify all the PEP double star-like sign patterns of the form .
Theorem 5.
Let be an -by- double star-like sign pattern of the form . If , then is PEP if and only if is equivalent to a superpattern of one of , , , and . If , then is PEP if and only if is equivalent to a superpattern of one of , and .
Proof.
It is enough to show the case . The sufficiency is clear. For the necessity, if is MPEP, then is equivalent to one of , , , and by Theorem 4. If is PEP but not MPEP, then must be a proper superpattern of one MPEP double star-like sign pattern. By Theorem 4, there are exactly five MPEP sign patterns in the class of -by- double star-like sign patterns of the form , up to equivalence. It follows that is equivalent to a superpattern of one of , , , and . □
It is known from [16] that if every matrix realization of an arbitrary n-by-n sign pattern is eventually positive, the is said to require the eventual positivity. Clearly, if the sign pattern requires the eventual positivity, then is PEP. In general, the converse does not hold. However, for the double star-like sign pattern of the form with exactly one nonzero diagonal entry, the answer is positive.
Proposition 5.
Let be an -by- double star-like sign pattern of the form with exactly one nonzero diagonal entry. Then the following statements are equivalent:
(1) is MPEP;
(2) is nonnegative and primitive;
(3) requires eventual positivity.
Proof.
follows from Theorem 4. follows from Theorem 2.3 in [16]. If requires eventual positivity, then is PEP. By Theorem 5, is equivalent to a superpattern of one of , , , and . For has exactly one nonzero diagonal entry, is equivalent to one of , , , and . Consequently, follows from Proposition 4. □
3. Eventual Exponential Positivity of the Double Star-like Sign Patterns
In this section, we investigate the eventual exponential positivity of the double star-like sign patterns of the form . First, we cite a necessary condition for an n-by-n sign pattern to be PEEP shown in [9].
Lemma 8
([9]). If an n-by-n sign pattern is PEEP, then is PEP.
The following proposition provides a necessary condition for a double star-like sign pattern of the form to be PEEP.
Proposition 6.
Let be an -by- double star-like sign pattern of the form . If is PEEP, then , , for all , and for all .
Proof.
Suppose that the double star-like sign pattern is PEEP. Then is PEP by Lemma 8. By Theorem 2, all nonzero off-diagonal entries of must be +. □
Now we turn to identifying all MPEEP double star-like sign patterns.
Proposition 7.
The double star-like sign pattern
is MPEEP.
Proof.
The double star-like sign pattern is PEEP for its positive part is irreducible. It is clear that each proper subpattern of is not irreducible and thus is not PEEP. It follows that is MPEEP. □
Now we identify all the MPEP sign patterns in class of double star-like sign patterns of the form .
Theorem 6.
Let be an -by- double star-like sign pattern of the form . Then is MPEEP if and only if , up to equivalence.
Proof.
Proposition 7 implies the sufficiency. For the necessity, assume that the -by- double star-like sign pattern is MPEEP. Then is PEEP, and by Proposition 6, , , for all , and for all . Suppose that some diagonal entries of are nonzero. Then is a proper superpattern of . Since is MPEEP, is not PEEP. However, is MPEEP by Proposition 7. It is a contradiction. Consequently, all the diagonal entries of must be 0. It follows that , up to equivalence. □
Theorem 6 indicates that there is exactly one MPEEP sign pattern for the class of double star-like sign patterns of the form , up to equivalence. Now we turn to classify all the -by- double star-like sign patterns that are PEEP.
Proposition 8.
Let be an -by- double star-like sign pattern of the form . Then is PEEP if and only if is equivalent to one of superpatterns of .
Proof.
The sufficiency is clear. For the necessity, if is MPEEP, then the conclusion follows from Theorem 6. If is PEEP, but not MPEEP, then must be a proper superpattern of the exactly one MPEEP double star-like sign pattern by Theorem 6, up to equivalence. □
It is known from [16] that if every matrix realization of sign pattern is eventually exponentially positive, then is said to require the eventual exponential positivity. Clearly, if a sign pattern requires eventual exponential positivity, then is also PEEP. Furthermore, the converse does not hold generally. However, for the double star-like sign patterns of the form , the converse holds. The following theorem, which follows readily from Proposition 8 and Theorem 2.9 in [16], establishes the characterizations of the PEEP double star-like sign patterns .
Theorem 7.
Let be a double star-like sign pattern of order of the form . Then the following statements are equivalent:
(1) is PEEP;
(2) All arcs of the simple 2-cycles , of the signed digraph are positive;
(3) All nonzero off-diagonal entries of are +;
(4) requires eventual exponential positivity;
(5) requires eventual positivity.
Note that it is shown in [17] that the n-by-n sign pattern requires the eventual exponential positivity, then every cycle in its signed digraph of length 2 or more is arc-positive.
4. Discussion and Conclusions
For the class of double star-like sign patterns of order of the form , we have identified the minimal PEP sign patterns and the minimal PEEP sign patterns, and consequently classified their PEP sign patterns and PEEP sign patterns. Our results indicate that the double star-like sign pattern is MPEEP if and only if the star sign patterns and are MPEEP, and the arcs and are positive. However, it is not true for the general sign patterns. It is interesting to ask how we can extend the previous result to some extent.
Author Contributions
B.-L.Y. is responsible for providing methods, proofs, analysis processes and checking the final manuscript. Z.L. is responsible for making a detailed analysis and correcting grammatical errors, G.-F.M. is responsible for analysis processes and checking the revisedl manuscript, and S.X. is responsible for writing and editing the orignial draft. All authors have read and agreed to the published version of the manuscript.
Funding
This paper was partially funded by the Natural Science Foundation of HYIT (16HGZ007).
Acknowledgments
The authors would like to express their sincerely thank to the anonymous referees and the editor for many constructive, detailed and helpful comments that help us correct and improve the original manuscript.
Conflicts of Interest
All authors in the paper have no conflict of interest.
References
- Hall, F.; Li, Z. Sign pattern matrices. In Handbook of Linear Algebra; Hogben, L., Ed.; Chapman & Hall/CRC Press: Boca Raton, FL, USA, 2007. [Google Scholar]
- Brualdi, R.A.; Ryser, H.J. Combinatorial Matrix Theory; Cambridge University Press: Cambridge, UK, 1991. [Google Scholar]
- Brualdi, R.A.; Shader, B.B. Matrices of Sign Solvable Linear Systems; Cambridge University Press: Cambridge, UK, 1995. [Google Scholar]
- Horn, R.A.; Johnson, C.R. Matrix Analysis; Cambridge University Press: Cambridge, UK, 1995. [Google Scholar]
- Shakeri, F.; Alizadeh, R. Nonnegative and eventually positive matrices. Linear Algebra Appl. 2017, 519, 19–26. [Google Scholar] [CrossRef]
- Noutsos, D.; Tsatsomeros, M.J. Reachability and holdability of nonnegative states. SIAM J. Matrix Anal. Appl. 2008, 25, 1619–1624. [Google Scholar] [CrossRef]
- Berman, A.; Catral, M.; Dealba, L.M.; Elhashash, A.; Hall, F.; Hogben, L.; Kim, I.J.; Olesky, D.D.; Tarazaga, P.; Tsatsomeros, M.J.; et al. Sign patterns that allow eventual positivity. Electron. J. Linear Algebra 2010, 19, 108–120. [Google Scholar] [CrossRef][Green Version]
- Yu, B.-L.; Huang, T.-Z.; Luo, J.; Hua, H.B. Potentially eventually positive double star sign patterns. Appl. Math. Lett. 2012, 30, 700–712. [Google Scholar] [CrossRef][Green Version]
- Archer, M.; Catral, M.; Erickson, C.; Haber, R.; Hogben, L.; Martinez-Rivera, X.; Ochoa, A. Potentially eventually exponentially positivie sign patterns. Involve 2013, 6, 261–271. [Google Scholar] [CrossRef][Green Version]
- Yu, B.-L.; Huang, T.-Z.; Xu, S. Potentially eventually positive 2-generalized star sign patterns. Electron. J. Linear Algebra 2019, 35, 100–115. [Google Scholar]
- Hogben, L.; Wilson, U. Eventual properties of matrices. Electron. J. Linear Algebra 2012, 23, 953–965. [Google Scholar] [CrossRef]
- Archer, M.; Catral, M.; Erickson, C.; Haber, R.; Hogben, L.; Martinez-Rivera, X.; Ochoa, A. Constructions of potentially eventually positive sign patterns with reducible positive part. Involve 2011, 4, 405–410. [Google Scholar] [CrossRef][Green Version]
- Yu, B.-L.; Huang, T.-Z.; Cheng, H.; Wang, D.D. Eventual positivity of tridiagonal sign patterns. Linear Multilinear Algebra 2014, 62, 853–859. [Google Scholar] [CrossRef]
- Yu, B.-L.; Huang, T.-Z.; Cui, J.; Deng, C.H. Potentially eventually positive star sign patterns. Electron. J. Linear Algebra 2016, 31, 541–859. [Google Scholar] [CrossRef][Green Version]
- Yu, B.-L. Potentially eventually positive Broom sign patterns. Bull. Korean Math. Soc. 2019, 56, 305–318. [Google Scholar]
- Ellison, E.M.; Hogben, L.; Tsatsomeros, M.J. Sign patterns that require eventual positivity or require eventual nonnegativity, Electron. J. Linear Algebra 2010, 19, 98–107. [Google Scholar]
- Erickson, C. Sign patterns that require eventual exponential nonnegativity. Electron. J. Linear Algebra 2015, 30, 171–195. [Google Scholar] [CrossRef][Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).