This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
|
|
- Bertram Lester
- 5 years ago
- Views:
Transcription
1 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 and sharing with colleagues. Other uses, including reproduction and distribution, or selling or licensing copies, or posting to personal, institutional or third party websites are prohibited. In most cases authors are permitted to post their version of the article (e.g. in Word or Tex form) to their personal website or institutional repository. Authors requiring further information regarding Elsevier s archiving and manuscript policies are encouraged to visit:
2 Linear Algebra and its Applications 434 (2011) Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: Minimum permanents on two faces of the polytope of doubly stochastic matrices Kyle Pula a, Seok-Zun Song b,,1, Ian M. Wanless c a b c Department of Mathematics, University of Denver, Denver, CO 80208, USA Department of Mathematics, Jeju National University, Jeju , Republic of Korea School of Mathematical Sciences, Monash University, Vic 3800, Australia A R T I C L E I N F O A B S T R A C T Article history: Received 6 July 2010 Accepted 18 August 2010 Available online 19 September 2010 Submitted by R.A. Brualdi AMS classification: 15A15 Keywords: Permanent Doubly stochastic Cohesive Barycentric We consider the minimum permanents and minimising matrices on the faces of the polytope of doubly stochastic matrices whose nonzero entries coincide with those of, respectively, [ ] [ ] In J U m,n = n,m In J and V J m,n 0 m,n = n,m. m J m,n J m,m Here J r,s denotes the r s matrix all of whose entries are 1, I n is the identity matrix of order n and 0 m is the m m zero matrix. We conjecture that V m,n is cohesive but not barycentric for 1 < n < m + m and that it is not cohesive for n m + m. We prove that it is cohesive for 1 < n < m + m and not cohesive for n 2m and confirm the conjecture computationally for n < 2m 200. We also show that U m,n is barycentric Elsevier Inc. All rights reserved. This research was undertaken while the first and second authors were visiting Monash University. The first author s visit was supported by the Australian Academy of Science, the Australian-American Fulbright Commission, and the National Science Foundation. The second author s visit was supported by the National Research Foundation of Korea and the Australian Academy of Science. The third author s research is supported by ARC discovery Grant DP Corresponding author. addresses: jpula@math.du.edu (K. Pula), szsong@jejunu.ac.kr (S.-Z. Song), ian.wanless@monash.edu (I.M. Wanless). 1 His research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education, Science and Technology (No ) /$ - see front matter 2010 Elsevier Inc. All rights reserved. doi: /j.laa
3 K. Pula et al. / Linear Algebra and its Applications 434 (2011) Introduction and preliminaries Let Ω n be the polytope of n n doubly stochastic matrices, that is, the n n nonnegative matrices whose row and column sums are all equal to 1. The permanent of an n n matrix A =[a ij ] is defined by per A = σ a 1σ(1) a nσ(n) where σ runs over all permutations of {1, 2,...,n}. Let D =[d ij ] be an n n nonnegative matrix with per D > 0, and let Ω(D) ={[x ij ] Ω n x ij = 0 whenever d ij = 0}. Then Ω(D) is a face of Ω n, and since it is nonempty and compact, Ω(D) contains at least one minimising matrix Y such that per Y per X for all X Ω(D). Let J r,s denote the r s matrix all of whose entries are 1, I n the identity matrix of order n and 0 m the m m zero matrix. In this paper, we study minimising matrices on the faces Ω(U m,n ) and Ω(V m,n ), where [ ] [ ] In J U m,n = n,m In J and V m,n = n,m. J m,n 0 m J m,n J m,m If per D > 0 then the barycenter b(d) of Ω(D) is given by b(d) = 1 P, per D P D where the summation extends over the set of all permutation matrices P with P D. Brualdi [1] defined an n-square (0, 1) matrix D to be cohesive if there is a matrix Z in the interior of Ω(D) for which per Z = min{per X X Ω(D)}. He defined an n-square (0, 1) matrix D to be barycentric if per b(d) = min{per X X Ω(D)}. Since b(d) always falls in the interior of Ω(D), being barycentric is a stronger property than being cohesive. We will consider the question of which values of parameters m, n make U m,n and V m,n barycentric, cohesive, or neither. In Section 2 we prove that V m,n is cohesive for 1 < n < m + m and not cohesive for n 2m. In Section 3 we show that U m,n is barycentric. Our results contribute towards solution of two problems from Minc s well-known catalogue of unsolved problems on permanents (see [2] for the most recent update). Problems 14 and 15 in Minc s list ask for a characterisation of cohesive and barycentric matrices, respectively. These problems were originally posed by Brualdi [1], who determined the minimising matrix on Ω(V 1,n ). Minc had resolved the face Ω(V m,2 ) in [4]. Song [5,7] determined the minimum permanent on Ω(V m,3 ), while the faces Ω(V 2,n ) and Ω(V 3,n ) were resolved by Song [6] and Song et al. [8,9], respectively. Taken together, the prior literature determines the minimising matrices of Ω(V m,n ) for m < 4orn < 4. Recall that an n n nonnegative matrix is said to be fully indecomposable if it contains no k (n k) zero submatrix for 1 k < n. We will use the following well-known Lemma from [3]. Lemma 1.1. Let D =[d ij ] be an n n fully indecomposable (0, 1) matrix, and suppose Y =[y ij ] is a minimising matrix on Ω(D). Then Y is fully indecomposable and per Y(i j) = per Y if d ij = 1 and y ij > 0, per Y(i j) per Y if d ij = 1 and y ij = 0. As usual, for any matrix M and lists L 1 and L 2 of row and column indices, respectively, M(L 1 L 2 ) denotes the submatrix formed by omitting the rows L 1 and columns L 2 from M. Terms of the form 0 0 occurring in our calculations should always be interpreted as The minimising matrices of Ω(V m,n ) In this section, we consider the minimum permanents and minimising matrices on the faces Ω(V m,n ). Throughout this section, we assume that m, n 2.
4 234 K. Pula et al. / Linear Algebra and its Applications 434 (2011) Let Y be a minimising matrix on Ω(V m,n ). Since the last m rows and last m columns of V m,n are the same, we can use the averaging method on those rows and columns of Y (by Theorem 1 in Minc [4]). Without loss of generality, we may therefore assume Y =[y ij ] is a minimising matrix of the form: x i if i = j n, 0 if i n and j n and i /= j, a y ij = i if i n and j > n, (1) a j if i > n and j n, x if i > n and j > n. Note that Y is doubly stochastic so x i = 1 ma i for 1 i n. Since V m,n is fully indecomposable, it follows from Lemma 1.1 that Y is also fully indecomposable. In particular a i > 0 for all i, although it is plausible that x i = 0 for some i or that x = 0. We next consider the possible choices of {a i } in (1), i.e. those that minimise per Y. Theorem 2.1. The minimising matrix Y has a 1 = a 2 = = a n. Proof. Without loss of generality we assume that a 1 a 2 a n and hence x 1 x 2 x n. Aiming for a contradiction, assume that a n > a 1.Let p 0 = per Y(1,n 1,n), p 1 = per Y(1,n,n+ 1 1,n,n+ 1), p 2 = per Y(1,n,n+ 1,n+ 2 1,n,n+ 1,n+ 2). If x n > 0 then by Lemma 1.1, we have that and hence x 1 p 0 + m 2 a 2 1 p 1 = per Y(n n) = per Y = per Y(1 1) = x n p 0 + m 2 a 2 n p 1 p 0 = m2 (a 2 n a2 1 ) x 1 x n p 1 = m(a 1 + a n )p 1. (2) Also, as a 1 > 0, per Y = per Y(1 n + 1), = ma 1 per Y(1,n+ 1 1,n+ 1), = ma 1 (x n p 1 + (m 1) 2 a 2 n p 2). ) and similarly per Y = ma n (x 1 p 1 + (m 1) 2 a 2 1 p 2, which leads to (m 1) 2 p 2 = a nx 1 a 1 x n a 1 a n (a n a 1 ) p 1 = p 1 a 1 a n. However, expanding per Y along the first and nth rows we find per Y = x 1 x n p 0 + m 2 a 2 n x 1p 1 + m 2 a 2 1 x np 1 + m 2 (m 1) 2 a 2 1 a2 n p 2, (3) = (1 ma 1 )(1 ma n )m(a 1 + a n )p 1 + m 2 a 2 n (1 ma 1)p 1 + m 2 a 2 1 (1 ma n)p 1 + m 2 a 1 a n p 1, = mp 1 (a 1 + a n ma 1 a n ). (4) Note that although (2) is only valid for x n > 0 we are free to substitute it in (3) in the case x n = 0as well, since in that case p 0 is being multiplied by 0. Examining (4) we see that by varying a 1,a n while preserving a 1 + a n we could decrease per Y unless a 1 = a n. By assumption, Y is a minimising matrix so a 1 = a n, from which the result follows.
5 K. Pula et al. / Linear Algebra and its Applications 434 (2011) In light of Theorem 2.1, for any given values of m and n, we are left with a one variable optimisation to find the minimising matrix in Ω(V m,n ) since Y is now determined by the value of x in (1). Let A x =[a ij ] be the (n + m) (n + m) matrix defined by 1 n (n m + m2 x) if i = j n, 0 if i n and j n and i /= j, a ij = (5) x if i > n and j > n, 1 (1 mx) otherwise. n ] when m n,orx [ ] m n, 1 in the case m > n. m 2 m Note that A x is doubly stochastic provided x [ 0, 1 m We next consider the problem of finding x in the stated range that minimises per A x (and hence satisfies per A x = per Y). Theorem 2.2. For n 2m and x > 0 we have per A x > per A 0 and thus A 0 is the unique minimising matrix in Ω(V m,n ). In contrast, for n < m + m it is never the case that A 0 is a minimising matrix in Ω(V m,n ). Proof. If m > n then A 0 is not even doubly stochastic, and if m = n then A 0 is not fully indecomposable. So by Lemma 1.1 we may assume that n > m. From(5) wehave per A x = In particular, and hence = m m ( ) 2 m i!n!(m i)! i (n m + i)! xi ( ) m i ( )2m 2i ( ) 1 1 n m+i n (1 mx) n (n m + m2 x), n!m! (n m + i)! n n+m i xi (1 mx) 2m 2i (n m + m 2 x) n m+i. (6) n! m! (n m)n m per A 0 =, (7) (n m)! nn+m per A x per A 0 = m ( ( = ( (n m + i)! xi (1 mx) 2m 2i ) n m m ( ) m ni (n m)! i 1 + m2 x n m 1 + m2 x n m (1 + mx) m (1 mx + 2m 2 x 2 ) m, = (1 + m 2 x 2 + 2m 3 x 3 ) m, 1 + m2 x n m ) n m (n m + m 2 x) i, ( ) m (1 mx) ( 2m 2i nx mx + m 2 x 2) i, i ) n m m ((1 m mx) 2 + nx mx + m 2 x 2) m, whenever n 2m. The first statement of the theorem follows. Next, consider x 0in(6), where per A x = n!m!(1 mx)2m (n m+m 2 x) n m (n m)!n n+m [ n!m!(n m)n m = (n m)!n n+m 1 m 2 x + + m 2 n!(m 1)!(n m) n m+1 (n m + 1)!n n+m 1 x + O(x 2 ) mn(n m) (n m + 1) x ] + O(x 2 ).
6 236 K. Pula et al. / Linear Algebra and its Applications 434 (2011) It follows that when n(n m) <(n m + 1)m (or in other words, n < m + m), per A x < per A 0 for small positive x. This proves the second statement in the Theorem. For m n we know x [0, 1/m]. Having examined the situation at the lower end of that interval, we now turn our attention to the upper end. Theorem 2.3. A 1/m is not a minimising matrix of Ω(V m,n ) for m n. Proof. From (6) there is a polynomial q(x) such that per A x = m! n n x m (n m + m 2 x) n + (1 mx) 2 q(x). Thus the derivative of per A x at x = 1/m is 2m! m 2 m. Not only is per A x increasing at x = 1/m, but in fact the rate of increase depends only on m. Next we consider similar questions for the case m n. Theorem 2.4. V m,n is cohesive for m n. Proof. From (5), we have per A x = m!2 n n 2n for x [ m n, 1 m 2 m per A (m n)/m 2 Therefore, per A 1/m per A (m n)/m 2 ( n i ) n i ]. In particular, we have (m n + i)! (n m + m2 x) i (1 mx) (2n 2i) x m n+i (8) = m!2 (m n) m n (m n)!m 2m and per A 1/m = m! m m. = mm (m n)! m!(m n) m n > 1 for 0 < n m, and A 1/m cannot be a minimising matrix. Now consider that per A x = m! ( (1 mx) 2n x m n + n2 (1 mx) 2n 2 x m n+1 ) n 2n (n m + m 2 x) (m n)! (m n + 1)! +(n m + m 2 x) 2 r(x), for some polynomial r(x). Therefore the derivative of per A x at x = (m n)/m 2 is m! (m n + 1)! (m n)m n m 2 2m. In particular, it is negative so A (m n)/m 2 is not a minimising matrix either. Combining Theorems , wehave: Corollary 2.5. V m,n is cohesive for n < m + m but not for n 2m. For the cases not covered by this corollary, i.e. m + [ m n ] < 2m, we have demonstrated that per A x is increasing at both end points of the interval m n, 1 but it remains to be determined m 2 m whether the minimum actually occurs at x = (m n)/m 2. As reported below, we have investigated this question computationally for m 100.
7 K. Pula et al. / Linear Algebra and its Applications 434 (2011) For n m, the barycenter of V m,n is located at A β where ( )( ) m n m 2 1 i=1 (i n m + i i 1)!(m i)! 2 1 β = ( )( ) 2 = m n m (i n m + 1)!(m i)! i i 2 β = m n m 2 + m i ((n m + i)!(m i)!i!) 1 m 2. m ((n m + i)!(m i)!i!) 1 The value of per b(v m,n ) can then be calculated from (6). For n < m, the barycenter is located at A β where n i ((m n + i)!(n i)!i!) 1 m 2 n ((m n + i)!(n i)!i!) 1 and the value of per b(v m,n ) can then be calculated from (8). In order to investigate small cases not covered by the preceding theory, two of the authors independently wrote programs for the computer algebra systems Maple and Mathematica. The results of their computations agreed and are as follows. Let P(x) = per A x and let P (x) denote its derivative. For 2 n < m 100, we found that P (x) has no rational roots in the interval [(m n)/m 2, ) and that P(x) is increasing at the barycenter. Either of these facts shows that V m,n is not barycentric in these cases although we know from Corollary 2.5 that it is cohesive. For 2 m n < 2m 200, we found that P(x) is increasing at the barycenter and that P (x) has no nonnegative rational roots when n /= m + m.ifn = m + m the only nonnegative rational root is x = 0. Again, either fact shows that V m,n is not barycentric. For 2 < m + m n < 2m 200,P(x) is monotone increasing throughout the interval [0, 1/m]. Once again, the only case in which P (x) has a root in this interval is for n = m + m and this root occurs at x = 0. Taken together with Corollary 2.5, this data suggests the following conjecture. Conjecture 2.1. V m,n is cohesive but not barycentric for 1 < n < m + m, while for n m + m, V m,n is not cohesive and A 0 is a minimising matrix. 3. The face Ω(U m,n ) We finish by determining the minimum permanent and minimising matrix on the face Ω(U m,n ). Note that for Ω(U m,n ) to be nonempty we require n m. Relying on Brualdi [1] for the case m = 1 and using a proof identical to that of Theorem 2.1 for m 2weget: Theorem 3.1. For any n m the unique minimising matrix in Ω(U m,n ) is A 0. By symmetry it is obvious that b(u m,n ) = A 0 and thus we also have: Corollary 3.2. U m,n is barycentric for any n m. The minimum permanent is given by (7). Corollary 3.3. For any n m the minimum permanent in U m,n is n! m! (n m)n m per A 0 = per b(u m,n ) = (n m)!. n n+m For example, the minimum permanent on Ω(U 4,n ) is 1)(n 2)(n 3)(n 4)n 4 per b(u 4,n ) = 4! (n n n+3, which is also the minimum permanent on Ω(V 4,n ) for n 6.
8 238 K. Pula et al. / Linear Algebra and its Applications 434 (2011) References [1] R.A. Brualdi, An interesting face of the polytope of doubly stochastic matrices, Linear and Multilinear Algebra 17 (1985) [2] G.-S. Cheon, I.M. Wanless, An update on Minc s survey of open problems involving permanents, Linear Algebra Appl. 403 (2005) [3] T.H. Foregger, On the minimum value of the permanent of a nearly decomposable doubly stochastic matrix, Linear Algebra Appl. 32 (1980) [4] H. Minc, Minimum permanents of doubly stochastic matrices with prescribed zero entries, Linear and Multilinear Algebra 15 (1984) [5] S.-Z. Song, Minimum permanents on certain faces of matrices containing an identity submatrix, Linear Algebra Appl. 108 (1988) [6] S.-Z. Song, Minimum permanents on certain doubly stochastic matrices, Linear Algebra Appl. 143 (1991) [7] S.-Z. Song, Minimum permanents and minimizing matrices on certain doubly stochastic matrices, Linear Algebra Appl (1992) [8] S.-Z. Song, S.-M. Hong, Y.-B. Jun, S.-J. Kim, Minimum permanents on a face of the polytope of doubly stochastic matrices, Linear Algebra Appl. 259 (1997) [9] S.-Z. Song, S.-G. Hwang, G.-S. Cheon, Minimum permanents on a face of the polytope of doubly stochastic matrices II, Linear and Multilinear Algebra 50 (2002)
This 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 education use, including for instruction at the authors institution
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 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 informationThis article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author s institution, sharing
More information1182 L. B. Beasley, S. Z. Song, ands. G. Lee matrix all of whose entries are 1 and =fe ij j1 i m 1 j ng denote the set of cells. The zero-term rank [5
J. Korean Math. Soc. 36 (1999), No. 6, pp. 1181{1190 LINEAR OPERATORS THAT PRESERVE ZERO-TERM RANK OF BOOLEAN MATRICES LeRoy. B. Beasley, Seok-Zun Song, and Sang-Gu Lee Abstract. Zero-term rank of a matrix
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 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 informationSpectrally 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 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 information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
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 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 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 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 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 information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
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 informationTrades in complex Hadamard matrices
Trades in complex Hadamard matrices Padraig Ó Catháin Ian M. Wanless School of Mathematical Sciences, Monash University, VIC 3800, Australia. February 9, 2015 Abstract A trade in a complex Hadamard matrix
More informationThis article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author s institution, sharing
More informationCOLUMN RANKS AND THEIR PRESERVERS OF GENERAL BOOLEAN MATRICES
J. Korean Math. Soc. 32 (995), No. 3, pp. 53 540 COLUMN RANKS AND THEIR PRESERVERS OF GENERAL BOOLEAN MATRICES SEOK-ZUN SONG AND SANG -GU LEE ABSTRACT. We show the extent of the difference between semiring
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 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 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 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 informationON THE MONOTONICITY OF THE DITTERT FUNCTION ON CLASSES OF NONNEGATIVE MATRICES
Bull. Korean Math. Soc. 30 (993), No. 2, pp. 265 275 ON THE MONOTONICITY OF THE DITTERT FUNCTION ON CLASSES OF NONNEGATIVE MATRICES GI-SANG CHEON. Introduction Let n denote the set of all n n doubly stochastic
More informationNon-Extendible Latin Cuboids
Non-Extendible Latin Cuboids Darryn Bryant db@maths.uq.edu.au, Barbara Maenhaut bmm@maths.uq.edu.au Nicholas J. Cavenagh nicholas cavenagh@yahoo.co.uk Ian M. Wanless ian.wanless@monash.edu Kyle Pula jpula@math.du.edu
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 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 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 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 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 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 informationLinear Algebra and its Applications
Linear Algebra and its Applications 431 (29) 188 195 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Lattices associated with
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 information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
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 informationSome inequalities for sum and product of positive semide nite matrices
Linear Algebra and its Applications 293 (1999) 39±49 www.elsevier.com/locate/laa Some inequalities for sum and product of positive semide nite matrices Bo-Ying Wang a,1,2, Bo-Yan Xi a, Fuzhen Zhang b,
More informationYimin Wei a,b,,1, Xiezhang Li c,2, Fanbin Bu d, Fuzhen Zhang e. Abstract
Linear Algebra and its Applications 49 (006) 765 77 wwwelseviercom/locate/laa Relative perturbation bounds for the eigenvalues of diagonalizable and singular matrices Application of perturbation theory
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 433 (2010) 476 482 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Nonsingularity of the
More informationarxiv: v3 [math.ra] 10 Jun 2016
To appear in Linear and Multilinear Algebra Vol. 00, No. 00, Month 0XX, 1 10 The critical exponent for generalized doubly nonnegative matrices arxiv:1407.7059v3 [math.ra] 10 Jun 016 Xuchen Han a, Charles
More informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
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 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds
More informationThis article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author s institution, sharing
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 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 informationOrthogonal similarity of a real matrix and its transpose
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 382 392 www.elsevier.com/locate/laa Orthogonal similarity of a real matrix and its transpose J. Vermeer Delft University
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 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 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 informationPascal Eigenspaces and Invariant Sequences of the First or Second Kind
Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea
More informationChapter 2: Linear Independence and Bases
MATH20300: Linear Algebra 2 (2016 Chapter 2: Linear Independence and Bases 1 Linear Combinations and Spans Example 11 Consider the vector v (1, 1 R 2 What is the smallest subspace of (the real vector space
More information8. Limit Laws. lim(f g)(x) = lim f(x) lim g(x), (x) = lim x a f(x) g lim x a g(x)
8. Limit Laws 8.1. Basic Limit Laws. If f and g are two functions and we know the it of each of them at a given point a, then we can easily compute the it at a of their sum, difference, product, constant
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 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 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 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 informationON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 4 (2004), #A21 ON MULTI-AVOIDANCE OF RIGHT ANGLED NUMBERED POLYOMINO PATTERNS Sergey Kitaev Department of Mathematics, University of Kentucky,
More informationTHE BOOLEAN IDEMPOTENT MATRICES. Hong Youl Lee and Se Won Park. 1. Introduction
J. Appl. Math. & Computing Vol. 15(2004), No. 1-2. pp. 475-484 THE BOOLEAN IDEMPOTENT MATRICES Hong Youl Lee and Se Won Park Abstract. In general, a matrix A is idempotent if A 2 = A. The idempotent matrices
More information12. Perturbed Matrices
MAT334 : Applied Linear Algebra Mike Newman, winter 208 2. Perturbed Matrices motivation We want to solve a system Ax = b in a context where A and b are not known exactly. There might be experimental errors,
More informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More informationResearch Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field
Complexity, Article ID 6235649, 9 pages https://doi.org/10.1155/2018/6235649 Research Article Minor Prime Factorization for n-d Polynomial Matrices over Arbitrary Coefficient Field Jinwang Liu, Dongmei
More informationWavelets and Linear Algebra
Wavelets and Linear Algebra 1 (2014) 43-50 Wavelets and Linear Algebra http://wala.vru.ac.ir Vali-e-Asr University Linear preservers of two-sided matrix majorization Fatemeh Khalooeia, a Department of
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 informationPermutation-like matrix groups
Linear Algebra and its Applications 422 (2007) 486 505 www.elsevier.com/locate/laa Permutation-like matrix groups Grega Cigler University of Ljubljana, Faculty for Mathematics and Physics, Jadranska 9,
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 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 informationLinear Algebra and its Applications
Linear Algebra and its Applications 435 (2011) 2889 2895 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Idempotent elements
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
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 informationResearch Article Attracting Periodic Cycles for an Optimal Fourth-Order Nonlinear Solver
Abstract and Applied Analysis Volume 01, Article ID 63893, 8 pages doi:10.1155/01/63893 Research Article Attracting Periodic Cycles for an Optimal Fourth-Order Nonlinear Solver Mi Young Lee and Changbum
More informationM17 MAT25-21 HOMEWORK 6
M17 MAT25-21 HOMEWORK 6 DUE 10:00AM WEDNESDAY SEPTEMBER 13TH 1. To Hand In Double Series. The exercises in this section will guide you to complete the proof of the following theorem: Theorem 1: Absolute
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 4 (2010) 118 1147 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Two error-correcting pooling
More informationA SIMPLIFIED FORM FOR NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL
A SIMPLIFIED FORM FOR NEARLY REDUCIBLE AND NEARLY DECOMPOSABLE MATRICES D. J. HARTFIEL Introduction and definitions. Nearly reducible and nearly decomposable matrices have been discussed in [4], [5], and
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 2012 41 52 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Compactness of matrix
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 informationLinear Algebra and its Applications
Linear Algebra and its Applications 437 (2012) 2719 2726 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Lie derivations
More informationMATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces.
MATH 304 Linear Algebra Lecture 8: Vector spaces. Subspaces. Linear operations on vectors Let x = (x 1, x 2,...,x n ) and y = (y 1, y 2,...,y n ) be n-dimensional vectors, and r R be a scalar. Vector sum:
More informationJournal 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 informationThe initial involution patterns of permutations
The initial involution patterns of permutations Dongsu Kim Department of Mathematics Korea Advanced Institute of Science and Technology Daejeon 305-701, Korea dskim@math.kaist.ac.kr and Jang Soo Kim Department
More informationDiscrete Applied Mathematics
Discrete Applied Mathematics 157 (2009 1696 1701 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Riordan group involutions and the -sequence
More informationAcyclic Digraphs arising from Complete Intersections
Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine
More informationFrom Satisfiability to Linear Algebra
From Satisfiability to Linear Algebra Fangzhen Lin Department of Computer Science Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong Technical Report August 2013 1 Introduction
More informationBoolean 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 informationA Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors 1
International Mathematical Forum, Vol, 06, no 3, 599-63 HIKARI Ltd, wwwm-hikaricom http://dxdoiorg/0988/imf0668 A Family of Nonnegative Matrices with Prescribed Spectrum and Elementary Divisors Ricardo
More informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
More informationHierarchical open Leontief models
Available online at wwwsciencedirectcom Linear Algebra and its Applications 428 (2008) 2549 2559 wwwelseviercom/locate/laa Hierarchical open Leontief models JM Peña Departamento de Matemática Aplicada,
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 informationTensor 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 informationAn Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace
An Alternative Proof of Primitivity of Indecomposable Nonnegative Matrices with a Positive Trace Takao Fujimoto Abstract. This research memorandum is aimed at presenting an alternative proof to a well
More informationThe maximal determinant and subdeterminants of ±1 matrices
Linear Algebra and its Applications 373 (2003) 297 310 www.elsevier.com/locate/laa The maximal determinant and subdeterminants of ±1 matrices Jennifer Seberry a,, Tianbing Xia a, Christos Koukouvinos b,
More informationUpper triangular matrices and Billiard Arrays
Linear Algebra and its Applications 493 (2016) 508 536 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Upper triangular matrices and Billiard Arrays
More informationVector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)
Vector Space Basics (Remark: these notes are highly formal and may be a useful reference to some students however I am also posting Ray Heitmann's notes to Canvas for students interested in a direct computational
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 informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
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 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 informationARTICLE IN PRESS European Journal of Combinatorics ( )
European Journal of Combinatorics ( ) Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Proof of a conjecture concerning the direct
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 information