Spectrally arbitrary star sign patterns
|
|
- Edward Holland
- 6 years ago
- Views:
Transcription
1 Linear Algebra and its Applications 400 (2005) wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics, University of Victoria, PO Box 3045, Victoria BC, Canada V8W 3P4 Received 30 August 2004; accepted 8 November 2004 Available online 20 January 2005 Submitted by RA Brualdi Abstract An n n sign pattern S n is spectrally arbitrary if, for any given real monic polynomial g(x) of degree n, there is a real matrix having sign pattern S n and characteristic polynomial g(x) All n n star sign patterns that are spectrally arbitrary, and all minimal such patterns, are characterized This subsequently leads to an explicit characterization of all n n star sign patterns that are potentially nilpotent It is shown that any super-pattern of a spectrally arbitrary star sign pattern is also spectrally arbitrary 2004 Elsevier Inc All rights reserved AMS classification: 05C50; 15A18 Keywords: Inertially arbitrary; Potentially nilpotent; Potentially stable; Spectrally arbitrary; Star sign pattern Research supported in part by NSERC through an USRA for RM Tifenbach and Discovery Grants for G MacGillivray and P van den Driessche Corresponding author addresses: gmacgill@mathuvicca (G MacGillivray), ryant@mathuvicca (RM Tifenbach), pvdd@mathuvicca (P van den Driessche) /$ - see front matter 2004 Elsevier Inc All rights reserved doi:101016/jlaa
2 100 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) Introduction Our goal is to characterize spectrally arbitrary star sign patterns To explain this goal, we start with some definitions and then put our problem in the context of other results on sign patterns An n n array whose entries are chosen from the set {+,, 0} is called a sign pattern Let S n = [s ij ] be an n n sign pattern (n 2) A real n n matrix M n = [m ij ] has sign pattern S n if sgn(m ij ) = s ij for all i and j If, for any given real monic polynomial g(x) of degree n, there is a real matrix having sign pattern S n and characteristic polynomial g(x), then S n is a spectrally arbitrary sign pattern (SAP) Thus, S n is a SAP if, given any self-conjugate spectrum, there is a real matrix having sign pattern S n and that spectrum Spectrally arbitrary sign patterns are normally identified up to equivalence, since the property of being a SAP is clearly preserved under negation, transposition, signature similarity and permutation similarity If there is a real matrix having sign pattern S n and characteristic polynomial g(x) = x n, then S n is potentially nilpotent; in particular each SAP must be potentially nilpotent The inertia of an n n matrix M n is the ordered triple i(m n ) = (i + (M n ), i (M n ), i 0 (M n )) where i + (M n ), i (M n ) and i 0 (M n ) are the number of eigenvalues of M n with positive, negative and zero real parts, respectively The sign pattern S n is an inertially arbitrary sign pattern (IAP) if, for any ordered triple of non-negative integers (i 1, i 2, i 3 ) such that i 1 + i 2 + i 3 = n, there is a real matrix M n having sign pattern S n such that i(m n ) = (i 1, i 2, i 3 ) The sign pattern S n is potentially stable if there is a real matrix M n having sign pattern S n and inertia i(m n ) = (0, n, 0) From the definitions, every SAP is an IAP and every IAP is potentially stable A super-pattern of S n is a sign pattern R n = [r ij ] such that if s ij /= 0, then r ij = s ij If R n is a super-pattern of S n, then S n is a sub-pattern of R n If sign pattern S n is a SAP (IAP) but none of its proper sub-patterns is a SAP (IAP), then S n is a minimal SAP (IAP) A sign pattern S n = [s ij ] is combinatorially symmetric if s ij /= 0 whenever s ji /= 0 The graph G(S n ) of a combinatorially symmetric sign pattern has vertices 1, 2,, n and an edge joining vertices i and j if and only if s ij /= 0 Note that loops are allowed A star is the graph with vertices 1, 2,, n and an edge joining a fixed centre vertex i and each leaf vertex j for all j /= i (and no other edges) In what follows, it is assumed that 1 is the centre vertex A combinatorially symmetric sign pattern S n is a star sign pattern if the graph obtained from G(S n ) by deleting all loops is a star, and more generally, is a tree sign pattern if this graph is a tree Spectrally arbitrary tree sign patterns, especially those whose graph (excluding loops) is a path, are considered in [1] A method, based on the implicit function theorem, for proving that a pattern (and all super-patterns) is a SAP is developed there A class of (full) spectrally arbitrary patterns is constructed in [2] by using a Soules matrix The implicit function theorem method is used in [3] to show that some Hessenberg sign patterns are minimal SAPs, the first such families for all orders to be presented Other spectrally arbitrary sign pattern classes are constructed in [4]
3 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) also by using the implicit function theorem method All potentially stable star sign patterns are characterized in [5]; we make use of this characterization in Section 5 The inertias of matrices having a symmetric star sign pattern are characterized in [6] Potentially nilpotent star sign patterns are considered in [7], in which explicit characterizations are given for patterns of orders two and three, and a recursive characterization for patterns of general order n is proved Further aspects of these sign pattern problems can be found in references of the papers cited above We begin with some preliminary results (Section 2) and use these to prove that two families of star sign patterns, Z np and Y n, are spectrally arbitrary (Section 3) We then use the implicit function theorem method to show that any super-pattern of these is also a SAP (Section 4) We show that Z np and Y n are the only minimal inertially arbitrary star sign patterns (Section 5) We characterize all star sign patterns that are potentially nilpotent (Section 6), and conclude (Section 7) with a summary of our results for star sign patterns 2 Preliminary results Throughout this paper, we use the following conventions The lower-case roman letters a, b, c and d (with or without subscripts) denote positive real numbers In all matrices and arrays, entries that are not specified are equal to zero Let M n be the real n n matrix α 1 γ 2 γ 3 γ n β 2 α 2 M n = β 3 α 3 β n α n with characteristic polynomial det(xi n M n ), denoted by f n (x) Expanding this determinant about the first row gives the following expression for f n (x) Lemma 21 The characteristic polynomial of M n (as above) is n n f n (x) = (x α j ) β i γ i (x α j ) i=2 2 j n Note that if β i = 0 or γ i = 0 for some i, then α i is a zero of f n (x), and hence an eigenvalue of M n Thus, such a matrix has an eigenvalue of fixed sign, so its sign pattern cannot be an IAP or a SAP From Lemma 21, the off-diagonal entries β i and γ i enter into the characteristic polynomial of M n only as a product β i γ i In a spectrally arbitrary star sign pattern the entries (1, i) and (i, 1) for 2 i n are non-zero (the sign pattern is irreducible) It is therefore sufficient to consider only
4 102 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) matrices with γ i = 1 for 2 i n and for star sign patterns it is sufficient to take entries (1, j) for 2 j n as + Lemma 22 Let n 2 If S n = [s ij ] is an inertially arbitrary star sign pattern, then s ii /= 0 for any leaf i Proof Let n 2 and let S n be an inertially arbitrary star sign pattern Let the real matrix α β 2 α 2 M n = β 3 α 3 β n i=2 α n have sign pattern S n Then, n n det(m n ) = α j β i 2 j n α j By definition of a star sign pattern, β i /= 0 for all i Suppose that α i = 0 for exactly one i with 2 i n Then det(m n ) /= 0 So M n has only non-zero eigenvalues and, thus, the eigenvalues that have zero real parts must be conjugate pairs of purely imaginary numbers Therefore i 0 (M n ) is even for any real matrix M n with sign pattern S n, implying that S n is not inertially arbitrary, and giving a contradiction Now suppose that α i = 0 for more than one i with 2 i n Then det(m n ) = 0 But this implies that i 0 (M n ) 1 for all M n with sign pattern S n, again giving a contradiction Therefore, s ii /= 0 for all 2 i n Corollary 23 Let n 2 If S n = [s ij ] is a spectrally arbitrary star sign pattern, then s ii /= 0 for any leaf i Lemma 24 Let n 2 and M n (as in Lemma 22) be a real matrix having a star sign pattern If M n is nilpotent, then the non-zero entries among α 2, α 3,, α n are distinct Proof By Lemma 21, the characteristic polynomial of M n is n n f n (x) = (x α j ) β i (x α j ) i=2 2 j n If α i = α j for some i, j 2 with i /= j, then α i is a zero of f n (x) = x n, and consequently α i = 0 Thus, if α i /= 0, then α i /= α j for all i, j 2 with i /= j
5 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) The following two results are used in our constructions of spectrally arbitrary star sign patterns Lemma 25 Let g(x) = x n + n 1 i=0 µ ix i be a real monic polynomial of degree n 1 Let t = max{ n 1 i=0 µ i, 1} Then t is greater than or equal to the absolute value of any zero of g(x) Furthermore, if γ > t and γ is real, then sgn(g(γ )) = sgn(γ n ) Proof Suppose γ > t = max{ n 1 i=0 µ i, 1} Then g(γ ) γ n = µ i γ i µ i γ i γ n 1 µ i < γ n i=0 i=0 Therefore g(γ ) /= 0 So, the absolute value of any zero of g(x) must be at most t Moreover, since g(x) is monic, g(x) as x and g(x) sgn( 1) n as x, thus sgn(g(γ )) = sgn(γ n ) for γ > t Lemma 26 Suppose a p < a p 1 < < a 1 and b 1 < b 2 < < b q are positive real numbers (where possibly p = 0 or q = 0) If p /= 0, then for each fixed i with 1 i p, q sgn ( a i + a j ) ( a i b k ) = sgn(( 1) p+q i ) 1 j p Further, if q /= 0, then for each fixed i with 1 i q, p sgn (b i + a j ) (b i b k ) = sgn(( 1) q i ) 1 j p 1 k q k /=i Proof q ( a i + a j ) ( a i b k ) i 1 = ( 1) (p i)+q (a j a i ) p j=i+1 (a i a j ) i=0 q (a i + b k ) Since each term in the product on the right is positive, the product on the left has the stated sign Similarly, p (b i + a j ) (b i b k ) 1 k q k /=i
6 104 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) = ( 1) q i p i 1 (b i + a j ) (b i b k ) q k=i+1 (b k b i ) giving the second statement 3 Spectrally arbitrary star sign patterns As in the note after Lemma 21, the first row of a star sign pattern can be assumed to be [s ] Let n 3 and 1 p n 2 Let Z np = [z ij ] be the n n star sign pattern with: z 11 = 0 { if 2 i p + 1 z ii = + if p + 2 i n { sgn( 1) i 1 if 2 i p + 1 z i1 = sgn( 1) n i+1 if p + 2 i n Thus, Z np = sgn( 1) p sgn( 1) n p 1 + sgn( 1) n p Note that Z np has p 1 negative entries and q = n p 1 1 positive entries among the entries z ii Theorem 31 The star sign pattern Z np (n 3 and 1 p n 2) is spectrally arbitrary Proof Let n 3 and 1 p n 2 be positive integers Define q = n p 1 and note that 1 q n 2 and p + q + 1 = n Let g(x) = x n + n 1 i=0 µ ix i be any real monic polynomial of degree n Find positive t greater than or equal to the absolute value of any zero of g(x); for example, as in Lemma 25, pick t = max{ n 1 i=0 µ i, 1} Pick positive numbers a 1, a 2,, a p and b 1, b 2,, b q such that
7 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) t < a p < a p 1 < < a 1 and p a j q b k = µ n 1 t < b 1 < b 2 < < b q This is always possible: first pick the numbers so that they satisfy the inequalities, then increase either a 1 or b q until equality in the third condition is satisfied For each i with 1 i p, let ( 1) i+1 g( a i ) c i = 1 j p ( a i + a j ) q ( a i b k ) and for each i with 1 i q, let ( 1) q+i g(b i ) d i = p (b i + a j ) 1 k q (b i b k ) k /=i By Lemmas 25 and 26, sgn(c i ) = + and sgn(d i ) = + Consider the following matrix M n having sign pattern Z np : c 1 a 1 c 2 a 2 M n = ( 1) p c p a p ( 1) q d 1 b 1 ( 1) q 1 d 2 b 2 d q b q Note that a i, b i, c i and d i are positive for all i, and for the entries in M n, c i is multiplied by ( 1) i and d i is multiplied by ( 1) q i+1 By Lemma 21, the characteristic polynomial of M n is f n (x) = x p q (x + a j ) (x b k ) p q + ( 1) i+1 c i (x + a j ) (x b k ) + q ( 1) q i d i 1 j p p (x + a j ) (x b k ) 1 k q k /=i
8 106 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) This polynomial is monic of degree n, and the coefficient of x n 1 is p q a j b k = µ n 1 which is the coefficient of x n 1 in g(x) For each i with 1 i p q f n ( a i ) = ( 1) i+1 c i ( a i + a j ) ( a i b k ) = g( a i ) and for each i with 1 i q f n (b i ) = ( 1) q i d i 1 j p p (b i + a j ) (b i b k ) = g(b i ) 1 k q k /=i Since f n (x) and g(x) are both monic and have the same coefficients of x n 1, the polynomial f n (x) g(x) has degree at most n 2 Furthermore, since a 1, a 2,, a p, b 1, b 2, b q are distinct, f n (x) g(x) has n 1 distinct zeroes Therefore f n (x) g(x) = 0 The characteristic polynomial of M n is g(x) and M n has sign pattern Z np Thus, Z np is a spectrally arbitrary star sign pattern Let n 2 and Y n = [y ij ] be the n n star sign pattern with: y 11 = + y ii = if i /= 1 y i1 = sgn( 1) i 1 if i /= Thus, Y n = + sgn( 1) n 1 Note that Y n is defined for n = 2 while Z np is not Although Z np and Y n are very similar, our proofs that these are SAPs are simpler if each pattern is treated individually Theorem 32 The star sign pattern Y n (n 2) is spectrally arbitrary Proof Let g(x) = x n + n 1 i=0 µ ix i be any real monic polynomial of degree n 2 Find positive t greater than or equal to the absolute value of any zero of g(x); for example, as in Lemma 25, pick t = max{ n 1 i=0 µ i, 1} Pick positive numbers a 0, a 1,, a n 1 such that
9 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) t < a n 1 < a n 2 < < a 1 and a 0 + a j = µ n 1 First, pick the numbers so they satisfy the inequalities, then increase either a 1 or a 0 until equality in the second condition is satisfied For each i with 1 i n 1, let c i = ( 1)i+1 g( a i ) ( a i + a j ) 1 j n 1 By Lemma 25, and Lemma 26 with q = 0 and p = n 1 1 in the first statement, sgn(c i ) = + Consider the following matrix having sign pattern Y n : M n = ( 1) n 1 c n 1 a c 1 a 1 c 2 a 2 a n 1 Note that a i and c i are positive for all i, and that for the entries in M n, c i is multiplied by ( 1) i By Lemma 21, the characteristic polynomial of M n is n 1 f n (x) = (x a 0 ) (x + a i ) + ( 1) i+1 c i (x + a j ) 1 j n 1 This polynomial is monic of degree n, and the coefficient of x n 1 is a 0 + a j = µ n 1 which is the coefficient of x n 1 in g(x) For each i with 1 i n 1, f n ( a i ) = ( 1) i+1 c i ( a i + a j ) = g( a i ) 1 j n 1 As in the proof of Theorem 31, f n (x) g(x) = 0 The characteristic polynomial of M n is g(x) and M n has sign pattern Y n Thus, Y n is a spectrally arbitrary star sign pattern Up to equivalence (as explained in Section 1), Y 2 is the unique spectrally arbitrary 2 2 sign pattern, and Z 31 and Y 3 are the only two minimal spectrally arbitrary 3 3 tree sign patterns; see [1] and [3] (in which Z 31 and Y 3 are denoted by T 3 and U 3, respectively)
10 108 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) Super-patterns of spectrally arbitrary star sign patterns Some terminology is introduced for the statements in this section Let X = {x j j J } be a set of variables with finite index set J Let Σ 0 (X) = 1 and let Σ i (X) be the sum of the products of the elements of the i-element subsets of X for each i with 1 i J For each j J, let X j = X \ {x j } For example, Σ 1 (X j ) = x k, Σ 2 (X j ) = x k x l k J \{j} k,l J \{j} k /=l Lemma 41 Let n 2 and X = {x 1, x 2,, x n } For each i with 1 i n, if j, k J and j /= k, then Proof Σ i (X k ) Σ i (X j ) = (x j x k )Σ i 1 (X j X k ) Σ i (X k ) = Σ i (X j X k ) + x j Σ i 1 (X j X k ) Σ i (X j ) = Σ i (X j X k ) + x k Σ i 1 (X j X k ) and subtracting gives the result Lemma 42 Let n 2 and X = {x 1, x 2,, x n } If Σ 1 (X 1 ) Σ 1 (X 2 ) Σ 1 (X n ) A n = Σ 2 (X 1 ) Σ 2 (X 2 ) Σ 2 (X n ) Σ n 1 (X 1 ) Σ n 1 (X 2 ) Σ n 1 (X n ) then det(a n ) = 1 i<j n (x i x j ) Proof (By induction) For n = 2, X = {x 1, x 2 } and det(a 2 ) = 1 1 x 2 x 1 = x 1 x 2 Now suppose that the statement is true for all m with 1 m n 1 Consider the matrix A n Subtracting the first column from each of the other columns and expanding about row 1, gives det(a n ) Σ 1 (X 2 ) Σ 1 (X 1 ) Σ 1 (X 3 ) Σ 1 (X 1 ) Σ 1 (X n ) Σ 1 (X 1 ) Σ 2 (X 2 ) Σ 2 (X 1 ) Σ 2 (X 3 ) Σ 2 (X 1 ) Σ 2 (X n ) Σ 2 (X 1 ) = Σ n 1 (X 2 ) Σ n 1 (X 1 ) Σ n 1 (X 3 ) Σ n 1 (X 1 ) Σ n 1 (X n ) Σ n 1 (X 1 )
11 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) (x 1 x 2 )Σ 0 (X 1 X 2 ) (x 1 x 3 )Σ 0 (X 1 X 3 ) (x 1 x n )Σ 0 (X 1 X n ) (x 1 x 2 )Σ 1 (X 1 X 2 ) (x 1 x 3 )Σ 1 (X 1 X 3 ) (x 1 x n )Σ 1 (X 1 X n ) = (x 1 x 2 )Σ n 2 (X 1 X 2 ) (x 1 x 3 )Σ n 2 (X 1 X 3 ) (x 1 x n )Σ n 2 (X 1 X n ) by Lemma 41 Taking out common column factors gives det(a n ) ( n ) Σ 1 (X 1 X 2 ) Σ 1 (X 1 X 3 ) Σ 1 (X 1 X n ) = (x 1 x i ) Σ 2 (X 1 X 2 ) Σ 2 (X 1 X 3 ) Σ 2 (X 1 X n ) i=2 Σ n 2 (X 1 X 2 ) Σ n 2 (X 1 X 3 ) Σ n 2 (X 1 X n ) ( n ) Σ 1 (W 2 ) Σ 1 (W 3 ) Σ 1 (W n ) = (x 1 x i ) Σ 2 (W 2 ) Σ 2 (W 3 ) Σ 2 (W n ) i=2 Σ n 2 (W 2 ) Σ n 2 (W 3 ) Σ n 2 (W n ) where W = {x 2, x 3,, x n } Using the inductive hypothesis, n det(a n ) = (x 1 x i ) (x i x j ) = (x i x j ) i=2 2 i<j n 1 i<j n A different proof of Lemma 42 can be obtained using the theory of alternants, see [8] The following theorem and its proof using the implicit function theorem can be found in [1]; also see [3, Lemma 21] Theorem 43 Let S n be an n n sign pattern, and suppose that there exists a nilpotent matrix M n having sign pattern S n and at least n non-zero entries, m i1 j 1, m i2 j 2,, m in j n Let M n be the matrix obtained by replacing these entries in M n by variables u 1, u 2,, u n, and let the characteristic polynomial of M n be f n (x) = x n h 1 x n 1 + h 2 x n ( 1) n 1 h n 1 x + ( 1) n h n If the Jacobian J = (h ([ 1, h 2,, h n ) (u 1, u 2,, u n ) = det hi u j is non-zero at (u 1, u 2,, u n ) = (m i1 j 1, m i2 j 2,, m in j n ), then every super-pattern of S n is spectrally arbitrary ])
12 110 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) Theorem 44 Let n 2 and S n be a spectrally arbitrary star sign pattern Then every super-pattern of S n is spectrally arbitrary Proof Let S n be a spectrally arbitrary star sign pattern Then, S n is potentially nilpotent and so there is an n n nilpotent real matrix M n (of the form given in Lemma 22) with sign pattern S n where α i, β i /= 0 for i 2 and α i /= α j for i, j 2 and i /= j (by results in Section 2) Let α u 1 v 1 M n = u 2 v 2 u n 1 v n 1 The conclusion will be shown to follow from an application of Theorem 43 with variables u 1, u 2,, u n 1, v n 1 By Lemma 21, the characteristic polynomial of M n is n 1 f n (x) = (x α 1 ) (x v j ) u i (x v j ) Letting 1 j n 1 f n (x) = x n h 1 x n 1 + h 2 x n ( 1) n 1 h n 1 x + ( 1) n h n and X = {v 1, v 2,, v n 1 }, then h 1 = α 1 + v i = Σ 1 (X {α 1 }) h 2 = α 1 v i + 1 i 1 <i 2 n 1 v i1 v i2 = Σ 2 (X {α 1 }) u i Σ 0 (X i ) h 3 = α 1 1 i 1 <i 2 n 1 u i 1 j n 1 v i1 v i2 + v j u i 1 i 1 <i 2 <i 3 n 1 = Σ 3 (X {α 1 }) u i Σ 1 (X i ) v i1 v i2 v i3
13 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) and in general for l 2, h l = Σ l (X {α 1 }) u i Σ l 2 (X i ) Taking the partial derivatives with respect to v n 1 and u i for 1 i n 1: h 1 h 1 h l = 1 = 0 = Σ l 2 (X i ) (l 2) v n 1 u i u i The partial derivatives h l v n 1 are not computed for l 2 because an examination of the following determinant shows that these terms do not appear in the calculation of the Jacobian (each such term is replaced by in J below) Now, let u n = v n 1 Then the Jacobian J = (h 1, h 2,, h n ) (u 1, u 2,, u n ) Σ 1 (X 1 ) Σ 1 (X 2 ) Σ 1 (X n 1 ) = Σ 2 (X 1 ) Σ 2 (X 2 ) Σ 2 (X n 1 ) Σ n 2 (X 1 ) Σ n 2 (X 2 ) Σ n 2 (X n 1 ) Σ 1 (X 1 ) Σ 1 (X 2 ) Σ 1 (X n 1 ) = ( 1) 2n 2 Σ 2 (X 1 ) Σ 2 (X 2 ) Σ 2 (X n 1 ) Σ n 2 (X 1 ) Σ n 2 (X 2 ) Σ n 2 (X n 1 ) = 1 i<j n 1 (v i v j ) by Lemma 42 Since the α i s are distinct for 2 i n, J is non-zero at (v 1, v 2,, v n 1, u 1, u 2,, u n 1 ) = (α 2, α 3,, α n, β 2, β 3,, β n ) Therefore, by Theorem 43, every super-pattern of S n is spectrally arbitrary Corollary 45 Every super-pattern of Y n or Z np (for appropriate n and p) is spectrally arbitrary, and thus inertially arbitrary Let Z + np and Z np be the super-patterns of Z np obtained by replacing the 0 in z 11 by + and, respectively By the above corollary, these star sign patterns are SAPs and IAPs
14 112 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) Potentially stable and inertially arbitrary star sign patterns If sign pattern S n is inertially arbitrary, then both S n and S n are potentially stable Such sign patterns are considered in Theorem 52 below The proof of this theorem relies on the next result, which follows directly from theorems proved in the characterization of potentially stable star sign patterns in [5, Theorems 35 and 42] Theorem 51 Let n 2 and S n be a potentially stable star sign pattern where s 12, s 13,, s 1n are + and s 22, s 33,, s nn are non-zero If among s 22, s 33,, s nn exactly q terms are +, say s i1 i 1, s i2 i 2,, s iq i q are +, then among s i1 1, s i2 1,, s iq 1 exactly q 2 terms are + Theorem 52 Let n 2 and S n be a star sign pattern where s ii is non-zero for any leaf i If S n and S n are both potentially stable, then S n is equivalent to one of Y n, Z np, Z np + or Z np (for appropriate p) Proof Let n 2 and S n be a star sign pattern where s 22, s 33,, s nn are non-zero and S n and S n are both potentially stable For all i such that 2 i n, s 1i and s i1 are non-zero, otherwise S n would not be a star sign pattern Case 1: Among s 22, s 33,, s nn there are both + and entries This implies n 3 By permutation similarity, assume that s 22, s 33,, s p+1,p+1 are and s p+2,p+2, s p+3,p+3,, s nn are + for some p such that 1 p n 2 By Theorem 51, there are exactly n p 1 2 positive entries, and thus exactly n p 1 2 negative entries, among s p+2,1, s p+3,1,, s n1 This is exactly the number of positive and negative entries among z p+2,1, z p+3,1,, z n1 in Z np Since the off-diagonal terms in a matrix having a star sign pattern enter into its characteristic polynomial only as products, S n is equivalent to the pattern obtained from S n by taking the negative of the main diagonal So, similarly, there are exactly p 2 positive entries among s 21, s 31,,s p+1,1 and thus p 2 negative entries This is exactly the number of positive and negative entries among z 21, z 31,,z p+1,1 in Z np So, by permutation similarity, s ij = z ij in Z np for all (i, j) /= (1, 1) Therefore, S n is equivalent to one of Z np, Z np + or Znp (depending on the sign of s 11) Case 2: The entries s 22, s 33,, s nn are all the same sign Since S n is equivalent to the star sign pattern obtained by taking the negative of the main diagonal in S n, assume s 22, s 33,, s nn are all Thus, s 11 is +, otherwise S n would have a strictly positive main diagonal Furthermore, similarly to Case 1, there are exactly n 1 2 positive and n 1 2 negative entries among s 21, s 31,, s n1 This is exactly the number of positive and negative entries among y 21, y 31,, y n1 in Y n Therefore, S n is equivalent to Y n
15 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) Note that Theorem 52 is sufficient for our purposes, since IAPs and SAPs are subclasses of the patterns S n for which S n and S n are both potentially stable However, using further results from [5], a characterization of all star sign patterns S n such that S n and S n are both potentially stable can be obtained Theorem 53 Let n 2 and S n be an inertially arbitrary star sign pattern Then S n is equivalent to one of Y n, Z np, Z + np or Z np (for appropriate p) Furthermore, Y n and Z np are minimal inertially arbitrary sign patterns and the only minimal inertially arbitrary star sign patterns Proof Let S n be an inertially arbitrary star sign pattern By Lemma 22, the entries s 22, s 33,, s nn are non-zero, thus the first statement follows directly from Theorem 52 Clearly, Z np + and Z np are not minimal As in Section 2, if s i1 or s 1i is replaced with 0 where 2 i n, any matrix with the resulting sign pattern has an eigenvalue with sign equal to s ii and so the sign pattern is not an IAP If s ii is replaced with 0 where 2 i n, any matrix with the resulting sign pattern has the sign of its determinant fixed, and so the sign pattern is not an IAP In Z np, the entry z 11 is equal to 0, so Z np is minimal In Y n, the entry y 11 is the only positive entry on the main diagonal, and so cannot be replaced by 0, so Y n is minimal Although the sign patterns Y n and Z np are minimal inertially (and thus, spectrally) arbitrary star sign patterns, there are proper sub-patterns of these that are potentially nilpotent or potentially stable For example, is potentially nilpotent and is potentially stable 6 Potentially nilpotent star sign patterns Theorem 61 Let n 2 and S n = [s ij ] be a star sign pattern If S n is potentially nilpotent and has s ii /= 0 for any leaf i, then, up to equivalence, S n is one of Y n, Z np, Z np + or Z np (for appropriate p)
16 114 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) Proof Let n 2 and S n be a potentially nilpotent star sign pattern with no zeroes among s 22, s 33,, s nn Let M n, as in Lemma 22, be a nilpotent matrix having sign pattern S n Thus, by Lemma 24, for i 2, the α i entries are distinct By permutation similarity, it can be assumed that α 2 < α 3 < < α n Case 1: Among α 2, α 3,, α n, there are both positive and negative entries This implies that n 3 Let p and q be the number of negative and positive entries, respectively (and note that 1 p, q n 2 and that p + q + 1 = n) Then α 2 < α 3 < < α p+1 < 0 < α p+2 < α p+3 < < α n Relabel α 2, α 3,, α n, β 2, β 3,, β n to give α γ 1 a 1 γ 2 a 2 M n = γ p a p δ 1 b 1 δ 2 b 2 δ q where 0 < a p < a p 1 < < a 1 and 0 < b 1 < b 2 < < b q By Lemma 21, the characteristic polynomial of M n is p q f n (x) = (x α 1 ) (x + a j ) (x b k ) 1 j p p q γ i (x + a j ) (x b k ) q δ i p (x + a j ) (x b k ) 1 k q k /=i Since M n is nilpotent, f n (x) = x n So, for each i with 1 i p, q ( a i ) n = γ i ( a i + a j ) ( a i b k ) 1 j p By Lemma 26, sgn(γ i ) = sgn( 1) n 1 (p+q i) = sgn( 1) i (since p + q + 1 = n) Moreover, for each i with 1 i q, b q
17 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) b n i = δ i p (b i + a j ) (b i b k ) 1 k p k /=i which implies, by Lemma 26, that sgn(δ i ) = sgn( 1) q i+1 So, for (i, j) /= (1, 1), the (i, j)th entry of M n has sign equal to z ij in Z np Thus, S n is equivalent to one of Z np, Z + np or Z np Case 2: For i 2, the α i entries all have the same sign; without loss of generality, assume that they are all negative (if M n is nilpotent, so is M n ) Order the leaf entries so that α 2 < α 3 < < α n and then relabel the matrix to give M n = α γ 1 a 1 γ 2 a 2 γ n 1 a n 1 Since M n is nilpotent, α 1 = n 1 a j is positive Furthermore, by Lemma 21, the characteristic polynomial of M n is n 1 f n (x) = (x α 1 ) (x + a i ) γ i 1 j n 1 (x + a j ) Since M n is nilpotent, f n (x) = x n, so for each i with 1 i n 1, ( a i ) n = γ i 1 j n 1 ( a i + a j ) implying that γ i has sign sgn( 1) i So, by permutation similarity, for all (i, j), the sign of the (i, j)th entry of M n is equal to y ij in Y n Therefore, S n is equivalent to Y n Theorem 61, Corollary 45 and results of [7], which are introduced next, can be used to characterize potentially nilpotent star sign patterns Let n 2 and S n be a star sign pattern By permutation similarity, it can be assumed that s 22, s 33,, s mm are non-zero and s m+1,m+1, s m+2,m+2,, s nn are zero (either collection could be empty) Let R 1 be the m m star sign pattern obtained by deleting the rows and columns numbered m + 1, m + 2,, n in S n Let R 2 be the (n m + 1) (n m + 1) star sign pattern obtained by deleting rows and columns numbered 2, 3,, m in S n and replacing s 11 with 0 For example, if
18 116 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) s s 21 s 22 s 31 s 33 S n = s m1 s mm s m+1,1 0 s m+2,1 0 s n1 0 then s s 21 s 22 R 1 = s 31 s 33 s m1 s mm s m+1,1 0 R 2 = s m+2,1 0 s n1 0 Theorem 62 [7, Theorems 2 and 3] Let n 2 and S n be a star sign pattern Then S n is potentially nilpotent if and only if R 1 and R 2 (as above) obtained from S n are potentially nilpotent In particular, R 2 is potentially nilpotent if and only if there is at least one positive and one negative entry among s m+1,1, s m+2,1,, s n1 Theorem 61 and Corollary 45 give necessary and sufficient conditions for the star sign pattern R 1 to be potentially nilpotent if R 1 has order at least 2 Theorem 62 gives necessary and sufficient conditions for the star sign pattern R 2 to be potentially nilpotent if the order of R 2 is at least 2; moreover, the only 1 1 potentially nilpotent sign pattern is S 1 = [0] Theorem 63 Let n 2 and S n be a star sign pattern Then S n is potentially nilpotent if and only if, up to equivalence, (a) S n is one of Y n, Z np, Z np +, Z np (for appropriate p); or, (b) for some m such that 1 m n 2, [ ] S11 S S n = 12 S 21 S 22
19 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) where S 12 = is m (n m); s m+1, s m+2, S 21 = s n is (n m) m and has both positive and negative entries among s m+1,1, s m+2,1,, s n1 ; S 22 = [0] (n m) (n m) ; and, (i) if m = 1, then S 11 = [0], or (ii) if m 2, then S 11 is one of Y m, Z mp, Z mp +, Z mp (for appropriate p) Theorem 64 Let n 2 and S n be a star sign pattern that is both potentially nilpotent and potentially stable Then S n has s ii /= 0 for any leaf i In particular, S n is equivalent to one of Y n, Z np, Z np + or Z np (for appropriate p) Proof Suppose n 2 and S n is a potentially nilpotent and potentially stable star sign pattern Let m be the number of non-zero entries among s 22, s 33,, s nn If m n 3, then there are at least two zeroes among s 22, s 33,, s nn, so, any matrix having sign pattern S n has determinant equal to zero Thus, m n 2, since S n is potentially stable If m = n 2, then there is exactly one zero among s 22, s 33,, s nn, implying that any matrix having sign pattern S n has a non-zero determinant Thus, since S n is potentially nilpotent, m = n 1 So, s ii /= 0 for all i 2 Therefore, by Theorem 63, S n is equivalent to one of Y n, Z np, Z np + or Z np (for appropriate p) 7 Summary The following theorem summarizes our results for star sign patterns Theorem 71 If n 2 and S n is a star sign pattern, then the following are equivalent: 1 S n is equivalent to one of Y n, Z np, Z np + or Z np (for appropriate p) 2 S n is spectrally arbitrary
20 118 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) S n is inertially arbitrary 4 S n is potentially nilpotent and has a loop at each of the n 1 leaves in its graph 5 S n and S n are both potentially stable and S n has a loop at each of the n 1 leaves in its graph 6 S n is potentially nilpotent and potentially stable The equivalences in Theorem 71 are illustrated in the strongly connected directed graph given above, with the implications following from the definitions of the appropriate terms along with previous theorems, corollaries and lemmas given by number The equivalence of (2) and (3) holds for any 3 3 sign pattern; see [3] However, in general (3) does not imply (2), as illustrated by an example with n = 4 in [4] where the graph of the sign pattern is not a tree The same example shows that (6) does not necessarily imply (2) for general sign patterns However, for tree sign patterns with n 4, it is unknown whether (3) implies (2), or whether (6) implies (2) or (3)
21 G MacGillivray et al / Linear Algebra and its Applications 400 (2005) Acknowledgment The authors thank DD Olesky for a careful reading of this manuscript and T Britz for discussions at the beginning of this project References [1] JH Drew, CR Johnson, DD Olesky, P van den Driessche, Spectrally arbitrary patterns, Linear Algebra Appl 308 (2000) [2] JJ McDonald, DD Olesky, MJ Tsatsomeros, P van den Driessche, On the spectra of striped sign patterns, Linear and Multilinear Algebra 51 (2003) [3] T Britz, JJ McDonald, DD Olesky, P van den Driessche, Minimal spectrally arbitrary sign patterns, SIAM J Matrix Anal Appl 26 (2004) [4] MS Cavers, KN Vander Meulen, Spectrally and inertially arbitrary sign patterns, Linear Algebra Appl 394 (2005) [5] Y Gao, J Li, On the potential stability of star sign pattern matrices, Linear Algebra Appl 327 (2001) [6] Y Shao, L Sun, Y Gao, Inertia sets of two classes of symmetric sign patterns, Linear Algebra Appl 384 (2004) [7] L Yeh, Sign pattern matrices that allow a nilpotent matrix, Bull Austral Math Soc 53 (1996) [8] T Muir, A Treatise on the Theory of Determinants, Dover, New York, 1960
Inertially arbitrary nonzero patterns of order 4
Electronic Journal of Linear Algebra Volume 1 Article 00 Inertially arbitrary nonzero patterns of order Michael S. Cavers Kevin N. Vander Meulen kvanderm@cs.redeemer.ca Follow this and additional works
More informationPotentially nilpotent tridiagonal sign patterns of order 4
Electronic Journal of Linear Algebra Volume 31 Volume 31: (2016) Article 50 2016 Potentially nilpotent tridiagonal sign patterns of order 4 Yubin Gao North University of China, ybgao@nuc.edu.cn Yanling
More informationOn the spectra of striped sign patterns
On the spectra of striped sign patterns J J McDonald D D Olesky 2 M J Tsatsomeros P van den Driessche 3 June 7, 22 Abstract Sign patterns consisting of some positive and some negative columns, with at
More informationSparse spectrally arbitrary patterns
Electronic Journal of Linear Algebra Volume 28 Volume 28: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 8 2015 Sparse spectrally arbitrary patterns Brydon
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationNilpotent matrices and spectrally arbitrary sign patterns
Electronic Journal of Linear Algebra Volume 16 Article 21 2007 Nilpotent matrices and spectrally arbitrary sign patterns Rajesh J. Pereira rjxpereira@yahoo.com Follow this and additional works at: http://repository.uwyo.edu/ela
More informationMinimum number of non-zero-entries in a 7 7 stable matrix
Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a
More informationSign Patterns with a Nest of Positive Principal Minors
Sign Patterns with a Nest of Positive Principal Minors D. D. Olesky 1 M. J. Tsatsomeros 2 P. van den Driessche 3 March 11, 2011 Abstract A matrix A M n (R) has a nest of positive principal minors if P
More informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationSIGN PATTERNS THAT REQUIRE OR ALLOW POWER-POSITIVITY. February 16, 2010
SIGN PATTERNS THAT REQUIRE OR ALLOW POWER-POSITIVITY MINERVA CATRAL, LESLIE HOGBEN, D. D. OLESKY, AND P. VAN DEN DRIESSCHE February 16, 2010 Abstract. A matrix A is power-positive if some positive integer
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 2010 661 669 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On the characteristic and
More informationGeometric Mapping Properties of Semipositive Matrices
Geometric Mapping Properties of Semipositive Matrices M. J. Tsatsomeros Mathematics Department Washington State University Pullman, WA 99164 (tsat@wsu.edu) July 14, 2015 Abstract Semipositive matrices
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
More informationQUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY
QUALITATIVE CONTROLLABILITY AND UNCONTROLLABILITY BY A SINGLE ENTRY D.D. Olesky 1 Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6 Michael Tsatsomeros Department of Mathematics
More informationIn this paper, we will investigate oriented bicyclic graphs whose skew-spectral radius does not exceed 2.
3rd International Conference on Multimedia Technology ICMT 2013) Oriented bicyclic graphs whose skew spectral radius does not exceed 2 Jia-Hui Ji Guang-Hui Xu Abstract Let S(Gσ ) be the skew-adjacency
More informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
More informationMinimum Ranks and Refined Inertias of Sign Pattern Matrices
Georgia State University ScholarWorks @ Georgia State University Mathematics Dissertations Department of Mathematics and Statistics 8-12-2016 Minimum Ranks and Refined Inertias of Sign Pattern Matrices
More informationOn the second Laplacian eigenvalues of trees of odd order
Linear Algebra and its Applications 419 2006) 475 485 www.elsevier.com/locate/laa On the second Laplacian eigenvalues of trees of odd order Jia-yu Shao, Li Zhang, Xi-ying Yuan Department of Applied Mathematics,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications xxx (2008) xxx xxx Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Graphs with three distinct
More informationRATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS. February 6, 2006
RATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS ATOSHI CHOWDHURY, LESLIE HOGBEN, JUDE MELANCON, AND RANA MIKKELSON February 6, 006 Abstract. A sign pattern is a
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
More informationThe effect on the algebraic connectivity of a tree by grafting or collapsing of edges
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 855 864 www.elsevier.com/locate/laa The effect on the algebraic connectivity of a tree by grafting or collapsing
More informationOrdering trees by their largest eigenvalues
Linear Algebra and its Applications 370 (003) 75 84 www.elsevier.com/locate/laa Ordering trees by their largest eigenvalues An Chang a,, Qiongxiang Huang b a Department of Mathematics, Fuzhou University,
More informationPRODUCT DISTANCE MATRIX OF A GRAPH AND SQUARED DISTANCE MATRIX OF A TREE. R. B. Bapat and S. Sivasubramanian
PRODUCT DISTANCE MATRIX OF A GRAPH AND SQUARED DISTANCE MATRIX OF A TREE R B Bapat and S Sivasubramanian Let G be a strongly connected, weighted directed graph We define a product distance η(i, j) for
More informationHOMEWORK 9 solutions
Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 9 solutions Due 4pm Wednesday, November 13. You will be graded not only on the correctness of your answers but
More informationOn the spectral radius of graphs with cut edges
Linear Algebra and its Applications 389 (2004) 139 145 www.elsevier.com/locate/laa On the spectral radius of graphs with cut edges Huiqing Liu a,meilu b,, Feng Tian a a Institute of Systems Science, Academy
More informationDefinition 2.3. We define addition and multiplication of matrices as follows.
14 Chapter 2 Matrices In this chapter, we review matrix algebra from Linear Algebra I, consider row and column operations on matrices, and define the rank of a matrix. Along the way prove that the row
More informationBounds for Levinger s function of nonnegative almost skew-symmetric matrices
Linear Algebra and its Applications 416 006 759 77 www.elsevier.com/locate/laa Bounds for Levinger s function of nonnegative almost skew-symmetric matrices Panayiotis J. Psarrakos a, Michael J. Tsatsomeros
More informationORIE 6334 Spectral Graph Theory September 8, Lecture 6. In order to do the first proof, we need to use the following fact.
ORIE 6334 Spectral Graph Theory September 8, 2016 Lecture 6 Lecturer: David P. Williamson Scribe: Faisal Alkaabneh 1 The Matrix-Tree Theorem In this lecture, we continue to see the usefulness of the graph
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationAbsolute value equations
Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationSign patterns that allow eventual positivity
Electronic Journal of Linear Algebra Volume 19 Volume 19 (2009/2010) Article 5 2009 Sign patterns that allow eventual positivity Abraham Berman Minerva Catral Luz Maria DeAlba Abed Elhashash Frank J. Hall
More informationCospectral graphs and the generalized adjacency matrix
Linear Algebra and its Applications 42 2007) 41 www.elsevier.com/locate/laa Cospectral graphs and the generalized adjacency matrix E.R. van Dam a,1, W.H. Haemers a,, J.H. Koolen b,2 a Tilburg University,
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationInequalities for the spectra of symmetric doubly stochastic matrices
Linear Algebra and its Applications 49 (2006) 643 647 wwwelseviercom/locate/laa Inequalities for the spectra of symmetric doubly stochastic matrices Rajesh Pereira a,, Mohammad Ali Vali b a Department
More informationINVERSE CLOSED RAY-NONSINGULAR CONES OF MATRICES
INVERSE CLOSED RAY-NONSINGULAR CONES OF MATRICES CHI-KWONG LI AND LEIBA RODMAN Abstract A description is given of those ray-patterns which will be called inverse closed ray-nonsingular of complex matrices
More informationMaximizing the numerical radii of matrices by permuting their entries
Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and
More informationAN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES
AN ELEMENTARY PROOF OF THE SPECTRAL RADIUS FORMULA FOR MATRICES JOEL A. TROPP Abstract. We present an elementary proof that the spectral radius of a matrix A may be obtained using the formula ρ(a) lim
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationOn minors of the compound matrix of a Laplacian
On minors of the compound matrix of a Laplacian R. B. Bapat 1 Indian Statistical Institute New Delhi, 110016, India e-mail: rbb@isid.ac.in August 28, 2013 Abstract: Let L be an n n matrix with zero row
More informationA property concerning the Hadamard powers of inverse M-matrices
Linear Algebra and its Applications 381 (2004 53 60 www.elsevier.com/locate/laa A property concerning the Hadamard powers of inverse M-matrices Shencan Chen Department of Mathematics, Fuzhou University,
More informationGraphs with given diameter maximizing the spectral radius van Dam, Edwin
Tilburg University Graphs with given diameter maximizing the spectral radius van Dam, Edwin Published in: Linear Algebra and its Applications Publication date: 2007 Link to publication Citation for published
More informationMATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants.
MATH 323 Linear Algebra Lecture 6: Matrix algebra (continued). Determinants. Elementary matrices Theorem 1 Any elementary row operation σ on matrices with n rows can be simulated as left multiplication
More informationEquivalence constants for certain matrix norms II
Linear Algebra and its Applications 420 (2007) 388 399 www.elsevier.com/locate/laa Equivalence constants for certain matrix norms II Bao Qi Feng a,, Andrew Tonge b a Department of Mathematical Sciences,
More informationRANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA
Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationTopics in linear algebra
Chapter 6 Topics in linear algebra 6.1 Change of basis I want to remind you of one of the basic ideas in linear algebra: change of basis. Let F be a field, V and W be finite dimensional vector spaces over
More informationPrimitive Digraphs with Smallest Large Exponent
Primitive Digraphs with Smallest Large Exponent by Shahla Nasserasr B.Sc., University of Tabriz, Iran 1999 A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF SCIENCE
More informationSign Patterns that Allow Diagonalizability
Georgia State University ScholarWorks @ Georgia State University Mathematics Dissertations Department of Mathematics and Statistics 12-10-2018 Sign Patterns that Allow Diagonalizability Christopher Michael
More informationNotes on Linear Algebra and Matrix Theory
Massimo Franceschet featuring Enrico Bozzo Scalar product The scalar product (a.k.a. dot product or inner product) of two real vectors x = (x 1,..., x n ) and y = (y 1,..., y n ) is not a vector but a
More informationLinear estimation in models based on a graph
Linear Algebra and its Applications 302±303 (1999) 223±230 www.elsevier.com/locate/laa Linear estimation in models based on a graph R.B. Bapat * Indian Statistical Institute, New Delhi 110 016, India Received
More informationPrimitive Matrices with Combinatorial Properties
Southern Illinois University Carbondale OpenSIUC Research Papers Graduate School Fall 11-6-2012 Primitive Matrices with Combinatorial Properties Abdulkarem Alhuraiji al_rqai@yahoo.com Follow this and additional
More informationSome spectral inequalities for triangle-free regular graphs
Filomat 7:8 (13), 1561 1567 DOI 198/FIL138561K Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Some spectral inequalities for triangle-free
More informationMatrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices
Matrices A. Fabretti Mathematics 2 A.Y. 2015/2016 Table of contents Matrix Algebra Determinant Inverse Matrix Introduction A matrix is a rectangular array of numbers. The size of a matrix is indicated
More informationNote on the Jordan form of an irreducible eventually nonnegative matrix
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 19 2015 Note on the Jordan form of an irreducible eventually nonnegative matrix Leslie Hogben Iowa State University, hogben@aimath.org
More informationQuestion: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?
Section 5. The Characteristic Polynomial Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Property The eigenvalues
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 (2012) 99 111 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On weighted directed
More informationEigenvalues of the Redheffer Matrix and Their Relation to the Mertens Function
Eigenvalues of the Redheffer Matrix and Their Relation to the Mertens Function Will Dana June 7, 205 Contents Introduction. Notations................................ 2 2 Number-Theoretic Background 2 2.
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationSparsity of Matrix Canonical Forms. Xingzhi Zhan East China Normal University
Sparsity of Matrix Canonical Forms Xingzhi Zhan zhan@math.ecnu.edu.cn East China Normal University I. Extremal sparsity of the companion matrix of a polynomial Joint work with Chao Ma The companion matrix
More informationarxiv:math/ v5 [math.ac] 17 Sep 2009
On the elementary symmetric functions of a sum of matrices R. S. Costas-Santos arxiv:math/0612464v5 [math.ac] 17 Sep 2009 September 17, 2009 Abstract Often in mathematics it is useful to summarize a multivariate
More informationGeneralized hyper-bent functions over GF(p)
Discrete Applied Mathematics 55 2007) 066 070 Note Generalized hyper-bent functions over GFp) A.M. Youssef Concordia Institute for Information Systems Engineering, Concordia University, Montreal, QC, H3G
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationEventually reducible matrix, eventually nonnegative matrix, eventually r-cyclic
December 15, 2012 EVENUAL PROPERIES OF MARICES LESLIE HOGBEN AND ULRICA WILSON Abstract. An eventual property of a matrix M C n n is a property that holds for all powers M k, k k 0, for some positive integer
More informationTwo applications of the theory of primary matrix functions
Linear Algebra and its Applications 361 (2003) 99 106 wwwelseviercom/locate/laa Two applications of the theory of primary matrix functions Roger A Horn, Gregory G Piepmeyer Department of Mathematics, University
More informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationChapter 1 Vector Spaces
Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationSystem theory and system identification of compartmental systems Hof, Jacoba Marchiena van den
University of Groningen System theory and system identification of compartmental systems Hof, Jacoba Marchiena van den IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF)
More informationTrees. A tree is a graph which is. (a) Connected and. (b) has no cycles (acyclic).
Trees A tree is a graph which is (a) Connected and (b) has no cycles (acyclic). 1 Lemma 1 Let the components of G be C 1, C 2,..., C r, Suppose e = (u, v) / E, u C i, v C j. (a) i = j ω(g + e) = ω(g).
More informationSymmetric 0-1 matrices with inverses having two distinct values and constant diagonal
Symmetric 0-1 matrices with inverses having two distinct values and constant diagonal Wayne Barrett Department of Mathematics, Brigham Young University, Provo, UT, 84602, USA Steve Butler Dept. of Mathematics,
More informationEnergy of Graphs. Sivaram K. Narayan Central Michigan University. Presented at CMU on October 10, 2015
Energy of Graphs Sivaram K. Narayan Central Michigan University Presented at CMU on October 10, 2015 1 / 32 Graphs We will consider simple graphs (no loops, no multiple edges). Let V = {v 1, v 2,..., v
More informationSums of diagonalizable matrices
Linear Algebra and its Applications 315 (2000) 1 23 www.elsevier.com/locate/laa Sums of diagonalizable matrices J.D. Botha Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003
More informationJ. D. Botha* Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003, South Africa
NORIT]- ~ Products of Diagonalizable Matrices J. D. Botha* Department of Mathematics University of South Africa P.O. Box 392 Pretoria 0003, South Africa Submitted by Richard A. Brualdi ABSTRACT Let 0:
More informationOn the Non-Symmetric Spectra of Certain Graphs
College of William and Mary W&M Publish College of William & Mary Undergraduate Honors Theses Theses, Dissertations, & Master Projects 5-2015 On the Non-Symmetric Spectra of Certain Graphs Owen Hill College
More informationarxiv:quant-ph/ v1 22 Aug 2005
Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices arxiv:quant-ph/58163v1 22 Aug 25 Abstract Chai Wah Wu IBM Research Division, Thomas J. Watson
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
More informationGENERATING SETS KEITH CONRAD
GENERATING SETS KEITH CONRAD 1 Introduction In R n, every vector can be written as a unique linear combination of the standard basis e 1,, e n A notion weaker than a basis is a spanning set: a set of vectors
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 194 (015) 37 59 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: wwwelseviercom/locate/dam Loopy, Hankel, and combinatorially skew-hankel
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
More informationGassner Representation of the Pure Braid Group P 4
International Journal of Algebra, Vol. 3, 2009, no. 16, 793-798 Gassner Representation of the Pure Braid Group P 4 Mohammad N. Abdulrahim Department of Mathematics Beirut Arab University P.O. Box 11-5020,
More informationCHAPTER 6. Direct Methods for Solving Linear Systems
CHAPTER 6 Direct Methods for Solving Linear Systems. Introduction A direct method for approximating the solution of a system of n linear equations in n unknowns is one that gives the exact solution to
More informationLaplacian spectral radius of trees with given maximum degree
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,
More informationOn some linear combinations of hypergeneralized projectors
Linear Algebra and its Applications 413 (2006) 264 273 www.elsevier.com/locate/laa On some linear combinations of hypergeneralized projectors Jerzy K. Baksalary a, Oskar Maria Baksalary b,, Jürgen Groß
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh June 2009 1 Linear independence These problems both appeared in a course of Benny Sudakov at Princeton, but the links to Olympiad problems are due to Yufei
More informationABSOLUTELY FLAT IDEMPOTENTS
ABSOLUTELY FLAT IDEMPOTENTS JONATHAN M GROVES, YONATAN HAREL, CHRISTOPHER J HILLAR, CHARLES R JOHNSON, AND PATRICK X RAULT Abstract A real n-by-n idempotent matrix A with all entries having the same absolute
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationLinear Algebra and Vector Analysis MATH 1120
Faculty of Engineering Mechanical Engineering Department Linear Algebra and Vector Analysis MATH 1120 : Instructor Dr. O. Philips Agboola Determinants and Cramer s Rule Determinants If a matrix is square
More informationOn decompositions of complete hypergraphs
On decompositions of complete hypergraphs Sebastian M Cioabă 1, Department of Mathematical Sciences, University of Delaware, Newar, DE 19716, USA André Kündgen Department of Mathematics, California State
More informationA property of orthogonal projectors
Linear Algebra and its Applications 354 (2002) 35 39 www.elsevier.com/locate/laa A property of orthogonal projectors Jerzy K. Baksalary a,, Oskar Maria Baksalary b,tomaszszulc c a Department of Mathematics,
More informationModified Gauss Seidel type methods and Jacobi type methods for Z-matrices
Linear Algebra and its Applications 7 (2) 227 24 www.elsevier.com/locate/laa Modified Gauss Seidel type methods and Jacobi type methods for Z-matrices Wen Li a,, Weiwei Sun b a Department of Mathematics,
More informationSmith Normal Form and Acyclic Matrices
Smith Normal Form and Acyclic Matrices In-Jae Kim and Bryan L Shader Department of Mathematics University of Wyoming Laramie, WY 82071, USA July 30, 2006 Abstract An approach, based on the Smith Normal
More information