Lower bounds for the minimum eigenvalue of Hadamard product of an M-matrix and its inverse

For the Hadamard product A ° A⁻¹ of an M-matrix A and its inverse A⁻¹, we give new lower bounds for the minimum eigenvalue of A ° A⁻¹. These bounds are strong enough to prove the conjecture of Fiedler and Markham [An inequality for the Hadamard product of an M-matrix and inverse M-matrix, Linear Algebra Appl. 101 (1988) 1-8].     

On a matrix decomposition of Hartwig and Spindelböck

The main task of the paper is to demonstrate that Corollary 6 in [R.E. Hartwig, K. Spindelböck, Matrices for which A^∗ and A^† commute, Linear and Multilinear Algebra 14 (1984) 241-256] provides a powerful tool to investigate square matrices with complex entries. This aim is achieved, on the one hand, by obtaining several original results involving square matrices, and, on the other hand, by reestablishing some of the facts already known in the literature, often in extended and/or generalized forms. The particular attention is paid to the usefulness of the aforementioned corollary to characterize various classes of matrices and to explore matrix partial orderings.     

The inverse positivity of perturbed tridiagonal M-matrices

A well-known property of an M-matrix M is that the inverse is element-wise non-negative, which we write as M^-1?0. In this paper, we consider element-wise perturbations of non-symmetric tridiagonal M-matrices and obtain sufficient bounds on the perturbations so that the non-negative inverse persists. These bounds improve the bounds recently given by Kennedy and Haynes [Inverse positivity of perturbed tridiagonal M-matrices, Linear Algebra Appl. 430 (2009) 2312-2323]. In particular, when perturbing the second diagonals (elements (l,l+2) and (l,l-2)) of M, these sufficient bounds are shown to be the actual maximum allowable perturbations. Numerical examples are given to demonstrate the effectiveness of our estimates.     

New lower bounds on eigenvalue of the Hadamard product of an M-matrix and its inverse

Some new lower bounds for the minimum eigenvalue of the Hadamard product of an M-matrix and its inverse are given. These bounds improve the results of [H.B. Li, T.Z. Huang, S.Q. Shen, H. Li, Lower bounds for the minimum eigenvalue of Hadamard product of an M-matrix and its inverse, Linear Algebra Appl. 420 (2007) 235-247].     

On the Kronecker Problem and related problems of Linear Algebra

We consider some classification problems of Linear Algebra related closely to the classical Kronecker Problem on pairs of linear maps between two finite-dimensional vector spaces. As shown by Djokovi? and Sergeichuk, the Kronecker’s solution is extended to the cases of pairs of semilinear maps and (more generally) pseudolinear bundles respectively. Our objective is to deal with the semilinear case of the Kronecker Problem, especially with its applications. It is given a new short solution both to this case and to its contragredient variant. The biquadratic matrix problem is investigated and reduced in the homogeneous case (in characteristic ≠2) to the semilinear Kronecker Problem. The integer matrix sequence Θ_n and Θ-transformation of polynomials are introduced and studied to get a simplified canonical form of indecomposables for the mentioned homogeneous problem. Some applications to the representation theory of posets with additional structures are presented.     

The period and base of a reducible sign pattern matrix

A square sign pattern matrix A (whose entries are ) is said to be powerful if all the powers A,A²,A³,…, are unambiguously defined. For a powerful pattern A, if A^l=A^l+p with l and p minimal, then l is called the base of A and p is called the period of Li et al. [On the period and base of a sign pattern matrix, Linear Algebra Appl. 212/213 (1994) 101-120] characterized irreducible powerful sign pattern matrices. In this paper, we characterize reducible, powerful sign pattern matrices and give some new results on the period and base of a powerful sign pattern matrix.     

Infinite-dimensional triangularization

The goal of this paper is to generalize the theory of triangularizing matrices to linear transformations of an arbitrary vector space, without placing any restrictions on the dimension of the space or on the base field. We define a transformation T of a vector space V to be triangularizable if V has a well-ordered basis such that T sends each vector in that basis to the subspace spanned by basis vectors no greater than it. We then show that the following conditions (among others) are equivalent: (1) T is triangularizable, (2) every finite-dimensional subspace of V is annihilated by $f(T)$ for some polynomial f that factors into linear terms, (3) there is a maximal well-ordered set of subspaces of V that are invariant under T, (4) T can be put into a crude version of the Jordan canonical form. We also show that any finite collection of commuting triangularizable transformations is simultaneously triangularizable, we describe the closure of the set of triangularizable transformations in the standard topology on the algebra of all transformations of V, and we extend to transformations that satisfy a polynomial the classical fact that the double-centralizer of a matrix is the algebra generated by that matrix.     

Some new bounds on the spectral radius of matrices

A new lower bound on the smallest eigenvalue τ(AB) for the Fan product of two nonsingular M-matrices A and B is given. Meanwhile, we also obtain a new upper bound on the spectral radius ρ(A°B) for nonnegative matrices A and B. These bounds improve some results of Huang (2008) [R. Huang, Some inequalities for the Hadamard product and the Fan product of matrices, Linear Algebra Appl. 428 (2008) 1551-1559].     

A note on “Constructing matrices with prescribed off-diagonal submatrix and invariant polynomials”

Let F be any field and let B a matrix of F^q×p. Zaballa found necessary and sufficient conditions for the existence of a matrix A=[A_ij]_i,j∈{1,2}∈F^(p+q)×(p+q) with prescribed similarity class and such that A₂₁=B. In an earlier paper [A. Borobia, R. Canogar, Constructing matrices with prescribed off-diagonal submatrix and invariant polynomials, Linear Algebra Appl. 424 (2007) 615-633] we obtained, for fields of characteristic different from 2, a finite step algorithm to construct A when it exists. In this short note we extend the algorithm to any field.     

An alternative approach to unitoidness

In a recent paper [C.R. Johnson, S. Furtado, A generalization of Sylvester’s law of inertia, Linear Algebra Appl. 338 (2001) 287-290], Sylvester’s law of inertia is generalized to any matrix that is ∗-congruent to a diagonal matrix. Such a matrix is called unitoid. In the present paper, an alternative approach to the subject of unitoidness is offered. Specifically, Sylvester’s law of inertia states that a Hermitian n × n matrix of rank r with inertia (p, q, n − r) is ∗-congruent to the direct sum

eⁱ⁰I_p⊕e^iπI_q⊕0I_n-r.     

Length problems for automorphisms of modules over local rings

Let R be a local ring and M a free module of a finite rank over R. An element τ ∈ Aut_RM is said to be simple if τ ≠ 1 fixes a hyperplane of M.We shall show that for any σ ∈ Aut_RM there exist a basis X for M and ρ ∈ Aut_RM such that ρ acts as a permutation on X and ρ⁻¹σ is a product of m or less than m simple elements in Aut_RM, where m is the order of the invariant factors of σ modulo the maximal ideal of R.Also we shall investigate the problem treated by E.W. Ellers and H. Ishibashi [Factorizations of transformations over a valuation ring, Linear Algebra Appl. 85 (1987) 17-27], in which they showed that σ is a product of simple elements and gave an upper bound of the smallest number of such factors of σ, whereas in the present paper we will give lower bounds of σ in case that R is a local domain. Moreover we will factorize θσ as a product of symmetries and transvections for some θ the matrix of which is diagonal.     

The automorphism group of certain higher degree forms

We consider symmetric indecomposable d-linear (d>2) spaces of dimension n over an algebraically closed field k of characteristic 0, whose center (the analog of the space of symmetric matrices of a bilinear form) is cyclic, as introduced by Reichstein [B. Reichstein, On Waring’s problem for cubic forms, Linear Algebra Appl. 160 (1992) 1-61]. The automorphism group of these spaces is determined through the action on the center and through the determination of the Lie algebra. Furthermore, we relate the Lie algebra to the Witt algebra.     

A note on polar decomposition based Geršgorin-type sets

Let B∈C^n×n denote a finite-dimensional square complex matrix. In [L. Smithies, R.S. Varga, Singular value decomposition Geršgorin sets, J. Linear Algebra Appl. 417 (2004) 370-380; N. Fontes, J. Kover, L. Smithies, R.S. Varga, Singular value decomposition normally estimated Geršgorin sets, Electron. Trans. Numer. Anal. 26 (2007) 320-329], Professor Varga and I introduced Geršgorin-type sets which were developed from singular value decompositions (SVDs) of B. In this note, our work is extended by introducing the polar SV-Geršgorin set, Γ^PSV(B). The set Γ^PSV(B) is a union of n closed discs in C, whose centers and radii are defined in terms of the entries of a polar decomposition B=Q|B|. The set of eigenvalues of B, σ(B), is contained in Γ^PSV(B).     

Zero-preserving iso-spectral flows based on parallel sums

Driessel [K.R. Driessel, Computing canonical forms using flows, Linear Algebra Appl 379 (2004) 353-379] introduced the notion of quasi-projection onto the range of a linear transformation from one inner product space into another inner product space. Here we introduce the notion of quasi-projection onto the intersection of the ranges of two linear transformations from two inner product spaces into a third inner product space. As an application, we design a new family of iso-spectral flows on the space of symmetric matrices that preserves zero patterns. We discuss the equilibrium points of these flows. We conjecture that these flows generically converge to diagonal matrices. We perform some numerical experiments with these flows which support this conjecture. We also compare our zero-preserving flows with the Toda flow.     

The kth lower bases of primitive non-powerful signed digraphs

In [J. Shao, L. You, H. Shan, Bound on the bases of irreducible generalized sign pattern matrices, Linear Algebra Appl. 427 (2007) 285-300], the authors extended the concept of the base from powerful sign pattern matrices to non-powerful irreducible sign pattern matrices. Recently, the kth local bases and the kth upper bases, which are generalizations of the bases, of primitive non-powerful signed digraphs were introduced. In this paper, we introduce a new parameter called the kth lower bases of primitive non-powerful signed digraphs and obtain some bounds for it. For some cases, the bounds we obtain are best possible and the extremal signed digraphs are characterized, respectively. Moreover, we show that there exist “gaps” in the kth lower bases set of primitive non-powerful signed digraphs.     

On extremal matrices of second largest exponent by Boolean rank

Let b = b(A) be the Boolean rank of an n × n primitive Boolean matrix A and exp(A) be the exponent of A. Then exp(A) ? (b − 1)² + 2, and the matrices for which equality occurs have been determined in [D.A. Gregory, S.J. Kirkland, N.J. Pullman, A bound on the exponent of a primitive matrix using Boolean rank, Linear Algebra Appl. 217 (1995) 101-116]. In this paper, we show that for each 3 ? b ? n − 1, there are n × n primitive Boolean matrices A with b(A) = b such that exp(A) = (b − 1)² + 1, and we explicitly describe all such matrices.     

Primitive non-powerful symmetric loop-free signed digraphs with given base and minimum number of arcs

In [B.M. Kim, B.C. Song, W. Hwang, Primitive graphs with given exponents and minimum number of edges, Linear Algebra Appl. 420 (2007) 648-662], the minimum number of edges of a simple graph on n vertices with exponent k was determined. In this paper, we completely determine the minimum number, H(n,k), of arcs of primitive non-powerful symmetric loop-free signed digraphs on n vertices with base k, characterize the underlying digraphs which have H(n,k) arcs when k is 2, nearly characterize the case when k is 3 and propose an open problem.     

Lie algebras of infinitesimal norm isometries

Given a norm on a finite dimensional vector space V, we may consider the group of all linear automorphisms which preserve it. The Lie algebra of this group is a Lie subalgebra of the endomorphism algebra of V having two properties: (1) it is the Lie algebra of a compact subgroup, and (2) it is “saturated” in a sence made precise below. We show that any Lie subalgebra satisfying these conditions is the Lie algebra of the group of linear automorphisms preserving some norm. There is an appendix on elementary Lie group theory.