The Group Inverse of extended Symmetric and Periodic Jacobi Matrices

Size: px
Start display at page:

Download "The Group Inverse of extended Symmetric and Periodic Jacobi Matrices"

Transcription

1 GRUPO MAPTHE Preprint 206 February 3, 206. The Group Inverse of extended Symmetric and Periodic Jacobi Matrices S. Gago Abstract. In this work, we explicitly compute the group inverse of symmetric and periodic Jacobi matrices with constant elements that have been extended by adding a row and a column conveniently defined. For this purpose, we interpret such matrices as the combinatorial Laplacian of a non complete wheel that has been obtained by adding a vertex to a cycle and some edges conveniently chosen. The obtained group inverse is an incomplete block matrix with a block Toeplitz structure. In addition, we obtain the effective resistances and the Kirchhoff index of non complete wheels.. Introduction and notation The invertibility of nonsingular tridiagonal or block tridiagonal matrices has been studied in recent years; see 3 for a review on the subject. Moreover, explicit inverses are known in some cases, for instance when the tridiagonal matrix is symmetric with constant diagonals and subject to some restrictions. In 9, da Fonseca and Petronilho obtained explicit inverses of tridiagonal 2 Toeplitz and 3 Toeplitz matrices which generalize some well-known results concerning the inverse of a tridiagonal Toeplitz matrix. Recently, M.J. Jiménez in her PhD Tesis gave an explicit formula for the inverse of p, r Toeplitz Jacobi matrices tridiagonal matrices whose diagonals are formed by quasi periodic sequences, see,2. The techniques used in the mentioned results are mainly based on the theory of orthogonal polynomials. For the singular case, there is also a big amount of work, for instance in 4 the authors carried out an exhaustive analysis of the generalized inverses of singular irreducible symmetric M matrices. The key idea of the approach was to identify any symmetric M matrix with a positive semi definite Schrödinger operator on a connected network whose conductances are given by the off diagonal elements of the M matrix. Moreover, explicit expressions for the group inverses in the cases of tridiagonal matrices and circulant matrices were obtained in 6. In this work, we present a new formula for the group inverse of an extended symmetric and periodic Jacobi matrix with constant elements. By extended we mean that a row and a column have been added to the matrix. The idea is to see the extended symmetric and periodic Jacobi matrix as the combinatorial Laplacian of a non complete wheel and hence to obtain the group inverse, by using some previous results obtained in 7. A non complete wheel is a wheel where the central vertex is connected to a few vertices of the cycle. This kind of networks has many applications in Computer Science as the central vertex is called a hub see 2. Therefore, the non complete wheel can be seen as a cycle with an added vertex and some new edges and hence, the result of 7 can be applied. Finally, we use the formula for the group inverse to give the effective resistances and the Kirchhoff Index a non complete wheel Mathematics Subject Classification: Keywords: Symmetric and Circulant Matrices, Inverses, Chebyshev polynomials.

2 2 S. Gago In the following, the triple Γ = V, E, c denotes a finite network, that is, a finite graph without loops nor multiple edges, with vertex set V = {,..., n} and edge set E, where each edge e ij = {i, j} has associated a conductance c ij > 0. The standard inner product on R n is denoted by,, thus, if u, v R n, then u, v = n k= u kv k. For any i =,..., n we denote by e i the i th vector of the standard basis of R n, by j the all ones vector of dimension n and by J the all ones matrix. A matrix is called a block Toeplitz matrix iff is a block matrix, which contains blocks that are repeated in each descending diagonal from left to right, as a Toeplitz matrix in which each descending diagonal from left to right is constant. A matrix A of order n = md + p, 0 < p < d, is called incomplete block matrix if it is partitioned from the top left hand corner using d d submatrices as far as possible. Thus A A m A m A =, A m A mm A mm+ A m+ A m+m A m+m+ where A ij, i, j =, 2,..., m is an d d matrix, A im+ and A m+j, i, j =, 2,..., m are d p matrices and A m+m+ is an p p matrix. The combinatorial Laplacian or simply the Laplacian of the network Γ is the matrix L = L ij, where L ii = n k= c ik, and L ij = c ij when i j. It is well known that the Laplacian is singular, symmetric and positive semi definite. Moreover Lu = 0 iff u is proportional to vector j. The group inverse of the Laplacian, L #, is known as the Green matrix of the network G. For every pair of vertices {i, j} we define the dipole between them as the vector π ij = e i e j. Observe that π ii = 0 and π ij = π ji. The effective resistance between two vertices {i, j} of a network Γ, is defined as Ri, j = Gπ ij, π ij = G ii + G jj 2G ij, and the total resistance of the network or Kirchhoff index is defined as KΓ = n Ri, j = n G ii. 2 i,j V Given m >, d, we consider a cycle C n on n = md vertices with constant conductances c = ci, i + > 0 for any i =,..., n. A non complete wheel n, m-w, is a network obtained from C n by adding a new vertex n + to m of the vertices of the cycle placed at the same distance, d, with new conductances a = cn +, + di, for any i =,..., m. It is known that the Laplacian matrix of the cycle C n, is a circulant matrix L = circ2c, c, 0,..., 0, c and its group inverse is G ij = n 2 6 i j n i j, i, j =,..., n, see 4. i= 2. The group inverse of non complete wheels In this section we give an explicit expression for the group inverse of extended symmetric and periodic Jacobi matrices. Not surprisingly, the expression is an incomplete block Toeplitz matrix whose coefficients involve Chebyshev polinomials. In order to obtain the claimed expression we consider the Laplacian matrix of the non complete wheel network n, m-w in terms of the Laplacian of the base cycle. Then, we obtain the matrix of order n + given by L + D s L = s, α

3 The inverse matrix of some circulant matrices 3 where D is a diagonal matrix whose non null elements, a, are placed at the + di elements of the diagonal, i =,..., m, s = a m e +di and α = ma. i= Theorem. The group inverse of L is where L # = L L 2 L 2 L 22 L 22 = 2cdn + and2 2acn + 2, L d a 2 = an + 2 2cd d2 + n + 2 n j m, with n i = a n6 + d + 5m + 6mii d 2, for any i =,..., d, and where L is the block Toeplitz matrix N N 2... N m. N L = m N N2 such that any submatrix N k, k =,..., m, has entries N k i h+ = + T m q N 2... N m N i kd h n i kd h an n h i + V k q V m k q c i h d nd U k 2 q + U m k q 2cd a V m q d 2 U m q d 2 k 2 + n + with i =,..., d h = 0,..., d and q = ad 2c +., + dh + nh nd 2 kd 3 d + 2 h n i + kd n 2 h n d 2 ad i 2 di h cd + dh d 6 6an + 2, Proof. In order to obtain L #, we use 7, Corollary which reads: L # n 2 CMC + α n J = 2 n α n j CMs α 2 + n 2, α n j s MC α + s Ms where C = αn + In + js, n and M = G GΠI + Π GΠ Π G, with Π the matrix whose columns are the dipoles a m π +i d +j d, for any i < j m.

4 4 S. Gago So, to obtain the result we basically need to compute matrix M = G GΠI + Π GΠ Π G. To do this we need to calculate the different involved matrices and their products in different steps. For the sake of readability, we develop the proofs in Section 4, throughout some technical lemmas. i In order to obtain B = I + Π GΠ, we use a reduced form Π GΠ = Π R G R Π R, ii where G R is the m m submatrix of G n2 J whose rows and columns are placed at + k d, for any k =,..., m, and Π R is the submatrix of Π obtained only by the m rows placed at + k d, for any k =,..., m Now we apply Woodbury s formula, see 5, to get B = I + Π R G R Π R = I Π R G R + Π R Π R Π R. Thus, M becomes where M R = G R + Π R Π R. M = G GΠI Π R G R + Π R Π R Π R Π G = G GΠΠ ΠΠ R G R + Π R Π R Π R Π G = = G GΠΠ ΠΠ R M R Π R Π G, Observe that both G R and Π R Π R are, respectively, the circulant matrices G R = d circ0, m,..., jm j,..., m, 2cm Π R Π R = a m mi J = a circ m,,...,. m Thus, for computing G R and G R + Π R Π R, we use Lemma. iii Now, from 6, Theorem 3.5, we obtain M R in Lemma 2. iv We next consider F = ΠΠ ΠΠ R M R Π R Π. Notice that ΠΠ is a matrix which has the circulant matrix a mcirc m,,..., as a submatrix at the rows and columns placed at + k d, for any k =,..., m, and 0 otherwise. It turns out that, F is the Toeplitz matrix described in Lemma 3. v Since, M = G GFG, we first compute matrix H = GF, see Lemma 4. vi Next, we compute matrix K = GFG = HG in Lemma 5. vii Again, M is a block Toeplitz matrix whose expression is obtained in Proposition 2. viii Finally, using Lemma 6, the claimed result of Theorem follows. 3. Effective resistances and Kirchhoff index for non complete wheels The Green matrix is a fundamental tool for computing some desired parameters of the network, like the effective resistances of the network or the Kirchhoff index, very useful in electric circuit theory or in organic chemistry, as natural indexes describing important structural properties of circuits or molecules. Therefore, once we have compute the Green matrix, the effective resistances between two vertices of the new network are easily obtained from Formula obtained in 3. Proposition. Given two vertices of Γ, the effective resistances of the network between them are:

5 The inverse matrix of some circulant matrices 5 a if i, j n +, i = k d + h, j = k 2 d + h 2 and k = k 2 k +, where k k 2 n and h, h 2 = 0,..., d, with h < h 2 when k = k 2, then Ri, j = + T m q a c h 2 h V k q V m k q c 2 h h 2 d d c + cn a 2c 2 h2 + h 2 2 h + h 2 d d U m q c U k 2q + U m k q h h 2 k d n h h 2 k d 2 k d + 2 h 2 h k d n 2 h 2 + d 2 k 2 + h 2 + h h 2h 2 d + nh h 2 + d n 2 d 2 6cn + 2, b if i = k d + h n + and j = n +, then d Ri, n + = T m q an V an m q c h2 h d nd + d 2 U m q + h2 h d cn cdn2 + + an 2 d 2 6h 2 6h d ad 2 2acnn + 2 6cn n + 2, 2cd with q = ad 2c +. Moreover, the Kirchoff index of Γ is KΓ = n + an 2c T m q 6c dn + d2 U m q + 2cd a + dn V m q + d dnn a 6c d 2 n. 2c Proof. The proof is straightforward if we observe that for i, j n+, then i = k d+h, j = k 2 d+h 2 for any k k 2 n and h, h 2 = 0,..., d, with h < h 2 when k = k 2, and if k = k 2 k +, then Ri, j = N h+,h + + N h2+,h 2+ 2N k2 k + h+,h 2+, and for i = k d + h n + and j = n +, then Ri, n + = N h+,h + + L 22 2L 2 h+, and simplifying we obtain the claimed result. Similarly, the Kirchoff index of the non complete wheel n, m-w is obtained by simplifying the expression KΓ = n + tracel = n + tracel + n + L 22. Finally, if we consider the case where d =, n = m, we obtain a complete Wheel, and in this case we notice that the Kirchhoff index coincides with the result obtained in 3. Corollary. The Kirchhoff index of a Wheel on n + vertices is KΓ = n + an 2c 2c T n q 6c n + U n q + a + n 3 V n q a nn c 4. Technical lemmas In this section we include the technical lemmas and their proofs. Observe that the first Lemma excludes the case of adding a pendant vertex m =. Besides, we point out that the result of the second Lemma 2 is obtained from the application of Theorem 3.5. from 6.

6 6 S. Gago Lemma. The inverse matrix of G R is the circulant matrix G 2c R = nm 2 circ b 0, b,,...,, b, where b 0 = m3 m 6 and b = m3 m + 2. On the other hand 6 2 G R + Π R Π R = nm 2 circ c 0, c, c 2,..., c 2, c, where c 0 = 2cb 0 + adm m 2, c = 2cb + adm 2, c 2 = 2c + adm 2. Lemma 2. The circulant matrix G R + Π R Π R is invertible iff m > and in this case where M R = G R + Π R Π R = circm,..., m m, Uj 2 q + U m j qd m j = 2cT m q with q = ad 2c +. Lemma 3. The matrix F is a block Toeplitz matrix given by F F 2... F m. F F = m F F2 2c + adm2, j =,..., m, 2acm F 2... F m F where each submatrix F i has all its elements equal 0 except the first one, and with q = ad 2c +. Proof. Observe that F i = f i = aδ i a2 d 2c f = am m f i = a m + a2 m U i 2 q + U m i q, for any i =,..., m, T m q + a2 m m j a 2 m, j= m j a 2 m i, for any i = 2,..., d. Therefore, we first compute Uj 2 q + U m j qd m j = 2c + adm2 2cT j= j= m q 2acm d = U j 2 q + U m j q 2c + adm2 2cT m q 2ac = j= j= d 2c 2cT m q ad T mq 2c + adm2 2ac = d 2c m2.

7 The inverse matrix of some circulant matrices 7 And now we have f = am m and for any i = 2,..., d, f i = a m a2 dm 2 2cm a2 dm 2 2cm a 2 Um qd 2cT m q 2c + adm2 2acm a 2 Ui 2 q + U m i qd 2cT m q 2c + adm2 2acm Lemma 4. The matrix H is a block Toeplitz matrix given by H H 2... H m. H H = m H H2 H 2... H m H = a a2 d 2c = a2 d 2c U m q T m q, U i 2 q + U m i q. T m q where each submatrix H k has all its elements equal 0 except its first column, and for any i =,..., d H i = d n a i V m q du m q, and for any k = 2,..., d, 2c T m q H k i = d n a i V k q V m k q d 2c T m q c ai + cu k 2q + U m k q, with q = ad 2c +. Proof. We point out that G is also a block Toeplitz matrix and thus H is again a block Toeplitz matrix, and hence we need to compute just the first d rows. We first define the following summations: s i, j = j f p, s 2 i, j = p=i j pf p and s 3 i, j = p=i j p 2 f p. p=i In particular, K = s, m = a a 2 T m q 2 T mq = 0, K 2 = s 2, m = a m V m q, 2 T m q K 3 = s 3, m = = 2c d a 2 T mq m 2 V m q 2mU m 2 q mm + 2. And moreover, B = s k +, m = a 2 T m q T m q B 2 = s 2 k +, m = a 2 +U k 2 q + U m k q U m 2 q m +. V m q V k q + V m k q, mv m q + kv m k q V k q

8 8 S. Gago Now observe that when j = + k d and k =,..., m, for i =,..., d we have that H k i = + g i,+l d f k l+ + g i,+l d f m+k l+ g i, f k + g i,+l d f k l+ l= g i,+l d f m+k l+ = A + A 2 + A 3. Firstly we suppose k >. We compute separately A 2 and A 3 as follows A 2 = A 22 = A 23 = k k f k l+ = k p= f p = s, k, k pf p = js, k s 2, k, p= k p 2 f p = k 2 s, k 2ks 2, k + s 3, k, k p= and thus, A 2 = g i,+l d f k l+ = α A 2 + α 2 A 22 + α 3 A 23 = + α 3 s 3, k. n 2 + 6i n + i A 2 6dn + 2i 2A d 2 A 23 = α + α 2 k + α 3 k 2 s, k α 2 + 2α 3 ks 2, k Besides, A 3 = A 32 = A 33 = f m+k l+ = m p=k+ f p = s k +, m, l f m+k l+ = m + ks k +, m s 2 k +, m, l 2 f m+k l+ = m + k 2 s k +, m 2m + ks 2 k +, m + s 3 k +, m, and thus, A 3 = = = g i,+l d f m+k l+ = α A 3 + α 2 A 32 + α 3 A 33 α + α 2 m + k + α 3 m + k 2 s k +, m α 2 + 2α 3 m + ks 2 k +, m + α 3 s 3 k +, m α + α 2 k + α 3 k 2 s k +, m α 2 + 2α 3 ks 2 k +, m + α 3 s 3 k +, m + α 2 m + α 3 m 2 + 2α 3 mk B 2mα 3 B 2.

9 The inverse matrix of some circulant matrices 9 Now adding all A + A 2 + A 3 = = n 2 6i n i + f k + α + α 2 k + α 3 k 2 f k α 2 + 2α 3 k K 2 kf k + α 3 K3 k 2 f k 2mα3 B 2 + α 2 m + α 3 m 2 + 2α 3 mk B = n 2 6i n i + α f k α 2 + 2α 3 kk 2 + α 3 K 3 2mα 3 B 2 + α 2 m + α 3 m 2 + 2α 3 mk B = d n a i V k q V m k q d 2c T m q c ai + c U k 2q + U m k q. Now observe that if k = then j =, and in this case A 2 = 0. Besides it holds s 2, m = f, s 2 2, m = K 2 f and s 3 2, m = K 3 f. Thus H i = g i, f + = g i,+l d f m+2 l n 2 6i n i + f α + α 2 m + + α 3 m + 2 f α 2 + 2α 3 m + K 2 f + α 3 K 3 f = n 2 6i n i + α α 2 m + α 3 m + 2 +α 2 + 2α 3 m + α 3 f α 2 + 2α 3 m + K 2 + α 3 K 3 = n 2 6i n i + α α 2 m α 3 m 2 f α 2 + 2α 3 m + K 2 + α 3 K 3 = 2di 6dn 2d 2 K 2 + 6d 2 K 3 = d n a i V m q du m q. 2c T m q Lemma 5. The matrix K is a block Toeplitz matrix given by K K 2... K m. K K = m K K2 K 2... K m K

10 0 S. Gago where each submatrix K k has as elements K k i,h+ = T m q 2cd a V m q d 2 U m q + kd n 2 h d 2 k 2, n h i + V k q V m k q + dh + nh nd n2 an c i h d nd U k 2 q + U m k q 6 + d2 6 with q = ad +, for any k =,..., m, i =,..., d and h = 0,..., d. 2c + 2 kd 3 d + 2 h n i Proof. Again we multiply two block Toeplitz matrices and thus K is a block Toeplitz matrix, and hence we can just compute only the first d rows. For each submatrix K k, k =,..., m, we compute its elements. We point out that the ih + -element of K k is the ij-element of K, with j = + k d + h, for any h = 0,..., d. K k i,h+ = h i,+l d g +l d,j = g i, h i, + h i,+l d g +l d,j + h i,+l d g +l d,j l= = A + A 2 + A 3. We compute separately A = h i, A 2 = = A 3 = = n 2 6h + kd dn h kd + d, h i,+l d n 2 6h + kd ldn h kd + ld h i,+l d n 2 6 h 2 2kdh k 2 d 2 + 2kd 2 + dhl d 2 l 2 + nh + kd ldn, h i,+l d n 2 6 h kd + ldn + h + kd ld, h i,+l d n 2 6 h 2 2kdh k 2 d 2 + 2kd 2 + dhl d 2 l 2 nh + kd + ldn. dk Besides, B = h i,+l d = a n 2c T m q U m q c a B 2 = V k q V m k q + V m q, dk k + 2 lh i,+l d = n a 2c T m q i U k 2 q + U m k q i k + U k 2 q + k + U m k q 2U m 2 q 2q V k q V m k q + V m q c kv k q kv m k q + V m q U k 2 q U m k q + U m q, a

11 The inverse matrix of some circulant matrices and K = h i,+l d = 0, l= K 2 = lh i,+l d = T m q V m q + i a d a 2c m + 2 m a 2c i m q + U m q m +, 2 K 3 = l 2 m + 3 h i,+l d = i + anm T m q d 2cd + an cd a V m q + 2c i m2 + 2m 3m q U m q + m2 2 + m + + 2c ad m + 2m +. 2 Now adding A + A 2 + A 3 = = n2 h i,+l d h i, 6h + kd dn h kd + d l= h i,+l d h 2 2kdh k 2 d 2 + 2kd 2 + dhl d 2 l 2 h i,+l d nh + kd ldn + h i,+l d nh + kd ldn h i, h + kd dn h kd + d + h 2 2kdh k 2 d 2 h i, = + 2kd 2 + dhk 2 h i, d 2 K 3 h i, + nh + kd2b + h i, dn2b 2 K 2 + h i, = 2nh i, kd + h d + 2nh + kdb 2ndB 2 + dn + 2dh + 2kd 2 K 2 d 2 K 3 n h i + V k q V m k q T m q an c i h d nd U k 2 q + U m k q 2cd a V m q d 2 U m q + dh + nh nd n2 6 + d kd 3 d + 2 h n i + kd n 2 h d 2 k 2, Finally, taking into account that qu m q U m 2 q = T m q, we obtain the desired result.

12 2 S. Gago Proposition 2. The group inverse of the Schur complement of L is a block Toeplitz matrix given by M M 2... M m. M M = m M M2 where each submatrix M k has as elements M k i,h+ = + T m q M 2... M m M i kd h n i kd h an n h i + V k q V m k q c i h d nd U k 2 q + U m k q 2cd a V m q d 2 U m q d 2 k 2 + d2, + dh + nh nd + 2 kd 3 d + 2 h n i + kd n 2 h with q = ad +, for any k =,..., m, i =,..., d and h = 0,..., d. 2c Lemma 6. The product Gs = n j m is a column vector where n i = a n6 + d + 5m + 6mii d 2, for any i =,..., d. Besides, it holds Ms = Gs. Proof. For a given row i =,..., d, we have Gs i = a g i,+k d = ag i, a g i,+k d = a n2 m k= k=2 i n i k d in k d + i a = a k=2 6n + 5m + dn 6mid + 2 i. Moreover, as G is a block Toeplitz matrix, it holds Gs i = Gs i+k d, for any k =,..., m. Besides, Ms = G GFGs = Gs GFGs = Gs, as it is straightforward to verify that FGs = 0,..., Acknowledgement This work has been supported by the Spanish Research Council Ministerio de Ciencia e Innovación under the project MTM R. References A. Ben-Israel, T.N.E. Greville:Generalized inverses. Theory and applications. 2nd Edition, Springer, New York, M.C. Golumbic, M. Stern, A. Levy, G. Morgenstern: Graph-Theoretic Concepts in Computer Science: 38th International Workshop, WG 202, Jerusalem, Israel, June 26-28, 202, Revised Selected Papers. Springer, 202 Edition.

13 The inverse matrix of some circulant matrices 3 3 E. Bendito, A. Carmona, A.M. Encinas, J.M. Gesto: A Formula for the Kirchhoff Index. Int. J. Quantum Chem., , E. Bendito, A. Carmona, A.M. Encinas, M. Mitjana: Generalized inverses of symmetric M matrices. Linear Algebra Appl., , A. Carmona, A.M. Encinas, M. Mitjana: Discrete elliptic operators and their Green operators. Linear Algebra Appl., , A. Carmona, A.M. Encinas, S. Gago, M.J. Jiménez, M. Mitjana: The inverse of some circulant matrices. Appl. Math. Comput., , A. Carmona, A.M. Encinas, S. Gago, M. Mitjana: Green operators of networks with a new vertex. Linear Algebra Appl., , Z. Cinkir: Deletion and contraction identities for the resistance values and the Kirchhoff index. Int. J. Quantum Chem., 20, C.M. da Fonseca, J. Petronilho: Explicit inverses of some tridiagonal matrices. Linear Algebra Appl., , P.J. Davis: Circulant Matrices. John Wiley & sons, New York, 979. A.M: Encinas, M.J. Jiménez: Floquet theory for second order linear homogeneous difference equations. J. Dif. Eq. and App., 206, DOI:0.080/ M.J. Jiménez: Ecuaciones en diferencias lineales de segundo orden y su aplicación al Análisis matricial. Phd. Thesis, G. Meurant: A review on the inverse of symmetric tridiagonal and block tridiagonal matrices. SIAM J. Matrix Anal. Appl., 3 992, W. Wang, D. Yang, Y. Luo: The Laplacian polynomial and Kirchhoff index of graphs derived from regular graphs. Discrete Appl. Math., 6 203, M.A. Woodbury Inverting modified matrices, Statistical Research Group, Memo. Rep. no. 42, Princeton University, Princeton, N. J, 950.

Explicit inverse of a tridiagonal (p, r) Toeplitz matrix

Explicit inverse of a tridiagonal (p, r) Toeplitz matrix Explicit inverse of a tridiagonal (p, r Toeplitz matrix A.M. Encinas, M.J. Jiménez Dpt. Matemàtiques, Universitat Politècnica de Catalunya - BarcelonaTech Abstract Tridiagonal matrices appears in many

More information

On the M-matrix inverse problem for singular and symmetric Jacobi matrices

On the M-matrix inverse problem for singular and symmetric Jacobi matrices Electronic Journal of Linear Algebra Volume 4 Volume 4 (0/0) Article 7 0 On the M-matrix inverse problem for singular and symmetric Jacobi matrices Angeles Carmona Andres Encinas andres.marcos.encinas@upc.edu

More information

GREEN MATRICES OF WEIGHTED GRAPHS WITH PENDANT VERTICES. Midsummer Combinatorial Workshop XX Prague, 28 July- 1 August 2014

GREEN MATRICES OF WEIGHTED GRAPHS WITH PENDANT VERTICES. Midsummer Combinatorial Workshop XX Prague, 28 July- 1 August 2014 GREEN MATRICES OF WEIGHTED GRAPHS WITH PENDANT VERTICES Silvia Gago joint work with Angeles Carmona, Andrés M. Encinas, Margarida Mitjana Midsummer Combinatorial Workshop XX Prague, 28 July- 1 August 2014

More information

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i )

1 Multiply Eq. E i by λ 0: (λe i ) (E i ) 2 Multiply Eq. E j by λ and add to Eq. E i : (E i + λe j ) (E i ) Direct Methods for Linear Systems Chapter Direct Methods for Solving Linear Systems Per-Olof Persson persson@berkeleyedu Department of Mathematics University of California, Berkeley Math 18A Numerical

More information

Inverse Perron values and connectivity of a uniform hypergraph

Inverse Perron values and connectivity of a uniform hypergraph Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou

More information

Green function, Effective Resistance, Lattice. operator K is named semi-definite and ts mn],; is

Green function, Effective Resistance, Lattice. operator K is named semi-definite and ts mn],; is The of a network 2 de ivlatematica Aplicada ni de Matematica Aplicada I U niversítat Politecníca de, Barcelona. Abstract. The díscrete Green functions and their have deserved the interest of m3ny resean:hers

More information

The inverse of a tridiagonal matrix

The inverse of a tridiagonal matrix Linear Algebra and its Applications 325 (2001) 109 139 www.elsevier.com/locate/laa The inverse of a tridiagonal matrix Ranjan K. Mallik Department of Electrical Engineering, Indian Institute of Technology,

More information

CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES

CLASSIFICATION 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 information

A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo

A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d

More information

Product distance matrix of a tree with matrix weights

Product distance matrix of a tree with matrix weights Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian

More information

INVERSE TRIDIAGONAL Z MATRICES

INVERSE TRIDIAGONAL Z MATRICES INVERSE TRIDIAGONAL Z MATRICES (Linear and Multilinear Algebra, 45() : 75-97, 998) J J McDonald Department of Mathematics and Statistics University of Regina Regina, Saskatchewan S4S 0A2 M Neumann Department

More information

The Distance Spectrum

The Distance Spectrum The Distance Spectrum of a Tree Russell Merris DEPARTMENT OF MATHEMATICS AND COMPUTER SClENCE CALlFORNlA STATE UNlVERSlN HAYWARD, CAL lfornla ABSTRACT Let T be a tree with line graph T*. Define K = 21

More information

The Local Spectra of Regular Line Graphs

The Local Spectra of Regular Line Graphs The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I

More information

Inverses of regular Hessenberg matrices

Inverses of regular Hessenberg matrices Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2010 27 30 June 2010. Inverses of regular Hessenberg matrices J. Abderramán

More information

The Adjoint of a Linear Operator

The Adjoint of a Linear Operator The Adjoint of a Linear Operator Michael Freeze MAT 531: Linear Algebra UNC Wilmington Spring 2015 1 / 18 Adjoint Operator Let L : V V be a linear operator on an inner product space V. Definition The adjoint

More information

The k-fibonacci matrix and the Pascal matrix

The k-fibonacci matrix and the Pascal matrix Cent Eur J Math 9(6 0 403-40 DOI: 0478/s533-0-0089-9 Central European Journal of Mathematics The -Fibonacci matrix and the Pascal matrix Research Article Sergio Falcon Department of Mathematics and Institute

More information

An Introduction to Discrete Vector Calculus on Finite Networks

An Introduction to Discrete Vector Calculus on Finite Networks Grupo ARIDIS REU 010, UW Notes for the Lecture, June 010. An Introduction to Discrete ector Calculus on Finite Networks A. Carmona and A.M. Encinas We aim here at introducing the basic terminology and

More information

Kernels 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 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 information

Matrix & Linear Algebra

Matrix & Linear Algebra Matrix & Linear Algebra Jamie Monogan University of Georgia For more information: http://monogan.myweb.uga.edu/teaching/mm/ Jamie Monogan (UGA) Matrix & Linear Algebra 1 / 84 Vectors Vectors Vector: A

More information

Resistance distance in wheels and fans

Resistance distance in wheels and fans Resistance distance in wheels and fans R B Bapat Somit Gupta February 4, 009 Abstract: The wheel graph is the join of a single vertex and a cycle, while the fan graph is the join of a single vertex and

More information

On the inverse of the adjacency matrix of a graph

On the inverse of the adjacency matrix of a graph Special Matrices Research Article DOI: 10.2478/spma-2013-0006 Special Matrices 2013 28-41 On the inverse of the adjacency matrix of a graph Abstract A real symmetric matrix G with zero diagonal encodes

More information

Tensor Complementarity Problem and Semi-positive Tensors

Tensor Complementarity Problem and Semi-positive Tensors DOI 10.1007/s10957-015-0800-2 Tensor Complementarity Problem and Semi-positive Tensors Yisheng Song 1 Liqun Qi 2 Received: 14 February 2015 / Accepted: 17 August 2015 Springer Science+Business Media New

More information

Algebra C Numerical Linear Algebra Sample Exam Problems

Algebra C Numerical Linear Algebra Sample Exam Problems Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric

More information

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2 MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

More information

A Numerical Algorithm for Block-Diagonal Decomposition of Matrix -Algebras, Part II: General Algorithm

A Numerical Algorithm for Block-Diagonal Decomposition of Matrix -Algebras, Part II: General Algorithm A Numerical Algorithm for Block-Diagonal Decomposition of Matrix -Algebras, Part II: General Algorithm Takanori Maehara and Kazuo Murota May 2008 / May 2009 Abstract An algorithm is proposed for finding

More information

Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J

Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central

More information

Kaczmarz algorithm in Hilbert space

Kaczmarz algorithm in Hilbert space STUDIA MATHEMATICA 169 (2) (2005) Kaczmarz algorithm in Hilbert space by Rainis Haller (Tartu) and Ryszard Szwarc (Wrocław) Abstract The aim of the Kaczmarz algorithm is to reconstruct an element in a

More information

arxiv: v1 [math.ra] 23 Feb 2018

arxiv: v1 [math.ra] 23 Feb 2018 JORDAN DERIVATIONS ON SEMIRINGS OF TRIANGULAR MATRICES arxiv:180208704v1 [mathra] 23 Feb 2018 Abstract Dimitrinka Vladeva University of forestry, bulklohridski 10, Sofia 1000, Bulgaria E-mail: d vladeva@abvbg

More information

RESISTANCE DISTANCE IN WHEELS AND FANS

RESISTANCE DISTANCE IN WHEELS AND FANS Indian J Pure Appl Math, 41(1): 1-13, February 010 c Indian National Science Academy RESISTANCE DISTANCE IN WHEELS AND FANS R B Bapat 1 and Somit Gupta Indian Statistical Institute, New Delhi 110 016,

More information

Sign Patterns with a Nest of Positive Principal Minors

Sign 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 information

Intrinsic products and factorizations of matrices

Intrinsic 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 information

On some matrices related to a tree with attached graphs

On some matrices related to a tree with attached graphs On some matrices related to a tree with attached graphs R. B. Bapat Indian Statistical Institute New Delhi, 110016, India fax: 91-11-26856779, e-mail: rbb@isid.ac.in Abstract A tree with attached graphs

More information

Spectrally arbitrary star sign patterns

Spectrally arbitrary star sign patterns Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,

More information

IN1993, Klein and Randić [1] introduced a distance function

IN1993, Klein and Randić [1] introduced a distance function IAENG International Journal of Applied Mathematics 4:3 IJAM_4_3_0 Some esults of esistance Distance irchhoff Index Based on -Graph Qun Liu Abstract he resistance distance between any two vertices of a

More information

Linear Algebra (Review) Volker Tresp 2017

Linear Algebra (Review) Volker Tresp 2017 Linear Algebra (Review) Volker Tresp 2017 1 Vectors k is a scalar (a number) c is a column vector. Thus in two dimensions, c = ( c1 c 2 ) (Advanced: More precisely, a vector is defined in a vector space.

More information

Group inverse for the block matrix with two identical subblocks over skew fields

Group inverse for the block matrix with two identical subblocks over skew fields Electronic Journal of Linear Algebra Volume 21 Volume 21 2010 Article 7 2010 Group inverse for the block matrix with two identical subblocks over skew fields Jiemei Zhao Changjiang Bu Follow this and additional

More information

The doubly negative matrix completion problem

The 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 information

Maximizing the numerical radii of matrices by permuting their entries

Maximizing 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 information

Some Reviews on Ranks of Upper Triangular Block Matrices over a Skew Field

Some Reviews on Ranks of Upper Triangular Block Matrices over a Skew Field International Mathematical Forum, Vol 13, 2018, no 7, 323-335 HIKARI Ltd, wwwm-hikaricom https://doiorg/1012988/imf20188528 Some Reviews on Ranks of Upper Triangular lock Matrices over a Skew Field Netsai

More information

a Λ q 1. Introduction

a Λ q 1. Introduction International Journal of Pure and Applied Mathematics Volume 9 No 26, 959-97 ISSN: -88 (printed version); ISSN: -95 (on-line version) url: http://wwwijpameu doi: 272/ijpamv9i7 PAijpameu EXPLICI MOORE-PENROSE

More information

On Euclidean distance matrices

On Euclidean distance matrices On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto

More information

The Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size

The Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size Filomat 30:13 (016), 3403 3409 DOI 1098/FIL1613403D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat The Singular Acyclic Matrices of

More information

On the adjacency matrix of a block graph

On 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 information

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by

c c c c c c c c c c a 3x3 matrix C= has a determinant determined by Linear Algebra Determinants and Eigenvalues Introduction: Many important geometric and algebraic properties of square matrices are associated with a single real number revealed by what s known as the determinant.

More information

INTERLACING PROPERTIES FOR HERMITIAN MATRICES WHOSE GRAPH IS A GIVEN TREE

INTERLACING PROPERTIES FOR HERMITIAN MATRICES WHOSE GRAPH IS A GIVEN TREE INTERLACING PROPERTIES FOR HERMITIAN MATRICES WHOSE GRAPH IS A GIVEN TREE C M DA FONSECA Abstract We extend some interlacing properties of the eigenvalues of tridiagonal matrices to Hermitian matrices

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 1982 NOTES ON MATRIX METHODS MASSACHUSETTS INSTITUTE OF TECHNOLOGY Chemistry 5.76 Revised February, 198 NOTES ON MATRIX METHODS 1. Matrix Algebra Margenau and Murphy, The Mathematics of Physics and Chemistry, Chapter 10, give almost

More information

Identities for minors of the Laplacian, resistance and distance matrices

Identities for minors of the Laplacian, resistance and distance matrices Identities for minors of the Laplacian, resistance and distance matrices R. B. Bapat 1 Indian Statistical Institute New Delhi, 110016, India e-mail: rbb@isid.ac.in Sivaramakrishnan Sivasubramanian Department

More information

Determinants Chapter 3 of Lay

Determinants Chapter 3 of Lay Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j

More information

Notes on Linear Algebra and Matrix Theory

Notes 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 information

Chapter 2 Spectra of Finite Graphs

Chapter 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 information

Linear Algebra and its Applications

Linear Algebra and its Applications Linear Algebra and its Applications 432 21 1691 172 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Drazin inverse of partitioned

More information

1. Introduction and notation

1. Introduction and notation Pré-Publicações do Departamento de Matemática Universidade de Coimbra Preprint Number 08 54 DYNAMICS AND INTERPRETATION OF SOME INTEGRABLE SYSTEMS VIA MULTIPLE ORTHOGONAL POLYNOMIALS D BARRIOS ROLANÍA,

More information

Orthogonal Symmetric Toeplitz Matrices

Orthogonal Symmetric Toeplitz Matrices Orthogonal Symmetric Toeplitz Matrices Albrecht Böttcher In Memory of Georgii Litvinchuk (1931-2006 Abstract We show that the number of orthogonal and symmetric Toeplitz matrices of a given order is finite

More information

Maximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector

Maximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector Maximum exponent of boolean circulant matrices with constant number of nonzero entries in its generating vector MI Bueno, Department of Mathematics and The College of Creative Studies University of California,

More information

INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES

INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES Indian J Pure Appl Math, 49: 87-98, March 08 c Indian National Science Academy DOI: 0007/s36-08-056-9 INTEGER POWERS OF ANTI-BIDIAGONAL HANKEL MATRICES João Lita da Silva Department of Mathematics and

More information

Interlacing Inequalities for Totally Nonnegative Matrices

Interlacing Inequalities for Totally Nonnegative Matrices Interlacing Inequalities for Totally Nonnegative Matrices Chi-Kwong Li and Roy Mathias October 26, 2004 Dedicated to Professor T. Ando on the occasion of his 70th birthday. Abstract Suppose λ 1 λ n 0 are

More information

The spectra of super line multigraphs

The spectra of super line multigraphs The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology

More information

The effect on the algebraic connectivity of a tree by grafting or collapsing of edges

The 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 information

Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix. Steve Kirkland University of Regina

Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix. Steve Kirkland University of Regina Conditioning of the Entries in the Stationary Vector of a Google-Type Matrix Steve Kirkland University of Regina June 5, 2006 Motivation: Google s PageRank algorithm finds the stationary vector of a stochastic

More information

Lemma 8: Suppose the N by N matrix A has the following block upper triangular form:

Lemma 8: Suppose the N by N matrix A has the following block upper triangular form: 17 4 Determinants and the Inverse of a Square Matrix In this section, we are going to use our knowledge of determinants and their properties to derive an explicit formula for the inverse of a square matrix

More information

AMS 209, Fall 2015 Final Project Type A Numerical Linear Algebra: Gaussian Elimination with Pivoting for Solving Linear Systems

AMS 209, Fall 2015 Final Project Type A Numerical Linear Algebra: Gaussian Elimination with Pivoting for Solving Linear Systems AMS 209, Fall 205 Final Project Type A Numerical Linear Algebra: Gaussian Elimination with Pivoting for Solving Linear Systems. Overview We are interested in solving a well-defined linear system given

More information

1 Positive definiteness and semidefiniteness

1 Positive definiteness and semidefiniteness Positive definiteness and semidefiniteness Zdeněk Dvořák May 9, 205 For integers a, b, and c, let D(a, b, c) be the diagonal matrix with + for i =,..., a, D i,i = for i = a +,..., a + b,. 0 for i = a +

More information

Lecture Notes in Linear Algebra

Lecture Notes in Linear Algebra Lecture Notes in Linear Algebra Dr. Abdullah Al-Azemi Mathematics Department Kuwait University February 4, 2017 Contents 1 Linear Equations and Matrices 1 1.2 Matrices............................................

More information

Determinants of Partition Matrices

Determinants of Partition Matrices journal of number theory 56, 283297 (1996) article no. 0018 Determinants of Partition Matrices Georg Martin Reinhart Wellesley College Communicated by A. Hildebrand Received February 14, 1994; revised

More information

CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX

CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX J. Appl. Math. & Computing Vol. 182005 No. 1-2 pp. 59-72 CONVERGENCE OF MULTISPLITTING METHOD FOR A SYMMETRIC POSITIVE DEFINITE MATRIX JAE HEON YUN SEYOUNG OH AND EUN HEUI KIM Abstract. We study convergence

More information

INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F

INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal

More information

Linear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey

Linear Algebra. Linear Equations and Matrices. Copyright 2005, W.R. Winfrey Copyright 2005, W.R. Winfrey Topics Preliminaries Systems of Linear Equations Matrices Algebraic Properties of Matrix Operations Special Types of Matrices and Partitioned Matrices Matrix Transformations

More information

Matrices. In this chapter: matrices, determinants. inverse matrix

Matrices. In this chapter: matrices, determinants. inverse matrix Matrices In this chapter: matrices, determinants inverse matrix 1 1.1 Matrices A matrix is a retangular array of numbers. Rows: horizontal lines. A = a 11 a 12 a 13 a 21 a 22 a 23 a 31 a 32 a 33 a 41 a

More information

Symmetric 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 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 information

General scan in flavor parameter space in the models with vector quark doublets and an enhancement in B X s γ process

General scan in flavor parameter space in the models with vector quark doublets and an enhancement in B X s γ process General scan in flavor parameter space in the models with vector quark doublets and an enhancement in B X s γ process Wang Wenyu Beijing University of Technology Hefei 2016-08-25 1/ 31 OUTLINE: 1 The problem

More information

On the number of spanning trees of K m n ± G graphs

On the number of spanning trees of K m n ± G graphs Discrete Mathematics and Theoretical Computer Science DMTCS vol 8, 006, 35 48 On the number of spanning trees of K m n ± G graphs Stavros D Nikolopoulos and Charis Papadopoulos Department of Computer Science,

More information

Generalized Principal Pivot Transform

Generalized Principal Pivot Transform Generalized Principal Pivot Transform M. Rajesh Kannan and R. B. Bapat Indian Statistical Institute New Delhi, 110016, India Abstract The generalized principal pivot transform is a generalization of the

More information

LAYERED NETWORKS, THE DISCRETE LAPLACIAN, AND A CONTINUED FRACTION IDENTITY

LAYERED NETWORKS, THE DISCRETE LAPLACIAN, AND A CONTINUED FRACTION IDENTITY LAYERE NETWORKS, THE ISCRETE LAPLACIAN, AN A CONTINUE FRACTION IENTITY OWEN. BIESEL, AVI V. INGERMAN, JAMES A. MORROW, AN WILLIAM T. SHORE ABSTRACT. We find explicit formulas for the conductivities of

More information

7 Matrix Operations. 7.0 Matrix Multiplication + 3 = 3 = 4

7 Matrix Operations. 7.0 Matrix Multiplication + 3 = 3 = 4 7 Matrix Operations Copyright 017, Gregory G. Smith 9 October 017 The product of two matrices is a sophisticated operations with a wide range of applications. In this chapter, we defined this binary operation,

More information

Linear Algebra: Lecture notes from Kolman and Hill 9th edition.

Linear Algebra: Lecture notes from Kolman and Hill 9th edition. Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices

More information

arxiv: v1 [math.ra] 13 Jan 2009

arxiv: v1 [math.ra] 13 Jan 2009 A CONCISE PROOF OF KRUSKAL S THEOREM ON TENSOR DECOMPOSITION arxiv:0901.1796v1 [math.ra] 13 Jan 2009 JOHN A. RHODES Abstract. A theorem of J. Kruskal from 1977, motivated by a latent-class statistical

More information

a s 1.3 Matrix Multiplication. Know how to multiply two matrices and be able to write down the formula

a s 1.3 Matrix Multiplication. Know how to multiply two matrices and be able to write down the formula Syllabus for Math 308, Paul Smith Book: Kolman-Hill Chapter 1. Linear Equations and Matrices 1.1 Systems of Linear Equations Definition of a linear equation and a solution to a linear equations. Meaning

More information

Math113: Linear Algebra. Beifang Chen

Math113: Linear Algebra. Beifang Chen Math3: Linear Algebra Beifang Chen Spring 26 Contents Systems of Linear Equations 3 Systems of Linear Equations 3 Linear Systems 3 2 Geometric Interpretation 3 3 Matrices of Linear Systems 4 4 Elementary

More information

A concise proof of Kruskal s theorem on tensor decomposition

A concise proof of Kruskal s theorem on tensor decomposition A concise proof of Kruskal s theorem on tensor decomposition John A. Rhodes 1 Department of Mathematics and Statistics University of Alaska Fairbanks PO Box 756660 Fairbanks, AK 99775 Abstract A theorem

More information

Matrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1...

Matrices. Chapter What is a Matrix? We review the basic matrix operations. An array of numbers a a 1n A = a m1... Chapter Matrices We review the basic matrix operations What is a Matrix? An array of numbers a a n A = a m a mn with m rows and n columns is a m n matrix Element a ij in located in position (i, j The elements

More information

RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA

RANK 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 information

1 Last time: least-squares problems

1 Last time: least-squares problems MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that

More information

Math 317, Tathagata Basak, Some notes on determinant 1 Row operations in terms of matrix multiplication 11 Let I n denote the n n identity matrix Let E ij denote the n n matrix whose (i, j)-th entry is

More information

MATH2210 Notebook 2 Spring 2018

MATH2210 Notebook 2 Spring 2018 MATH2210 Notebook 2 Spring 2018 prepared by Professor Jenny Baglivo c Copyright 2009 2018 by Jenny A. Baglivo. All Rights Reserved. 2 MATH2210 Notebook 2 3 2.1 Matrices and Their Operations................................

More information

arxiv: v1 [math.co] 6 Feb 2011

arxiv: v1 [math.co] 6 Feb 2011 arxiv:1102.1144v1 [math.co] 6 Feb 2011 ON SUM OF POWERS OF LAPLACIAN EIGENVALUES AND LAPLACIAN ESTRADA INDEX OF GRAPHS Abstract Bo Zhou Department of Mathematics, South China Normal University, Guangzhou

More information

FORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2. July 25, 2006

FORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2. July 25, 2006 FORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2 LESLIE HOGBEN AND HEIN VAN DER HOLST July 25, 2006 Abstract. For a given simple graph G, S(G) is defined to be the set of real symmetric matrices

More information

Boolean Inner-Product Spaces and Boolean Matrices

Boolean Inner-Product Spaces and Boolean Matrices Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver

More information

Normalized Laplacian spectrum of two new types of join graphs

Normalized Laplacian spectrum of two new types of join graphs Journal of Linear and Topological Algebra Vol. 6, No. 1, 217, 1-9 Normalized Laplacian spectrum of two new types of join graphs M. Hakimi-Nezhaad a, M. Ghorbani a a Department of Mathematics, Faculty of

More information

Linear graph theory. Basic definitions of linear graphs

Linear graph theory. Basic definitions of linear graphs Linear graph theory Linear graph theory, a branch of combinatorial mathematics has proved to be a useful tool for the study of large or complex systems. Leonhard Euler wrote perhaps the first paper on

More information

Spectra of the generalized edge corona of graphs

Spectra of the generalized edge corona of graphs Discrete Mathematics, Algorithms and Applications Vol 0, No 08) 85000 0 pages) c World Scientific Publishing Company DOI: 04/S7938309850007 Spectra of the generalized edge corona of graphs Yanyan Luo and

More information

Math 240 Calculus III

Math 240 Calculus III The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A

More information

Permutation transformations of tensors with an application

Permutation transformations of tensors with an application DOI 10.1186/s40064-016-3720-1 RESEARCH Open Access Permutation transformations of tensors with an application Yao Tang Li *, Zheng Bo Li, Qi Long Liu and Qiong Liu *Correspondence: liyaotang@ynu.edu.cn

More information

The following two problems were posed by de Caen [4] (see also [6]):

The following two problems were posed by de Caen [4] (see also [6]): BINARY RANKS AND BINARY FACTORIZATIONS OF NONNEGATIVE INTEGER MATRICES JIN ZHONG Abstract A matrix is binary if each of its entries is either or The binary rank of a nonnegative integer matrix A is the

More information

Connections and Determinants

Connections and Determinants Connections and Determinants Mark Blunk Sam Coskey June 25, 2003 Abstract The relationship between connections and determinants in conductivity networks is discussed We paraphrase Lemma 312, by Curtis

More information

EIGENVALUES AND EIGENVECTORS 3

EIGENVALUES AND EIGENVECTORS 3 EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices

More information

A RIEMANN-ROCH THEOREM FOR EDGE-WEIGHTED GRAPHS

A RIEMANN-ROCH THEOREM FOR EDGE-WEIGHTED GRAPHS A RIEMANN-ROCH THEOREM FOR EDGE-WEIGHTED GRAPHS RODNEY JAMES AND RICK MIRANDA Contents 1. Introduction 1 2. Change of Rings 3 3. Reduction to Q-graphs 5 4. Scaling 6 5. Reduction to Z-graphs 8 References

More information

Graphs with Integral Spectrum

Graphs with Integral Spectrum Graphs with Integral Spectrum Omran Ahmadi Department of Combinatorics & Optimization University of Waterloo Waterloo, Ontario, N2L 3G1, Canada oahmadid@math.uwaterloo.ca Noga Alon Department of Mathematics

More information

c 2005 Society for Industrial and Applied Mathematics

c 2005 Society for Industrial and Applied Mathematics SIAM J. MATRIX ANAL. APPL. Vol. XX, No. X, pp. XX XX c 005 Society for Industrial and Applied Mathematics DISTRIBUTIONS OF THE EXTREME EIGENVALUES OF THE COMPLEX JACOBI RANDOM MATRIX ENSEMBLE PLAMEN KOEV

More information

Journal of Symbolic Computation. On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field

Journal of Symbolic Computation. On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field Journal of Symbolic Computation 47 (2012) 480 491 Contents lists available at SciVerse ScienceDirect Journal of Symbolic Computation journal homepage: wwwelseviercom/locate/jsc On the Berlekamp/Massey

More information

MINIMUM DEVIATION, QUASI-LU FACTORIZATION OF NONSINGULAR MATRICES.

MINIMUM DEVIATION, QUASI-LU FACTORIZATION OF NONSINGULAR MATRICES. MINIMUM DEVIATION, QUASI-LU FACTORIZATION OF NONSINGULAR MATRICES. M.I. BUENO AND C.R. JOHNSON Abstract. Not all matrices enjoy the existence of an LU factorization. For those that do not, a number of

More information