The Best Lower Bound for the Permanent of a Correlation Matrix of Rank Two

If 1≤k≤n, then Cor(n,k) denotes the set of all n×n real correlation matrices of rank not exceeding k. Grone and Pierce have shown that if A∈Cor (n, n-1), then per(A)≥n/(n-1). We show that if A∈Cor(n,2), then , and that this inequality is the best possible.     

On the jordan form of the tensor product over fields of prime characteristic

Let A, B denote the companion matrices of the polynomials x^m,xⁿ over a field F of prime order p and let λ,μ be non-zero elements of an extension field K of F. The Jordan form of the tensor product (λI + A)⊗(μI + B) of invertible Jordan matrices over K is determined via an equivalent study of the nilpotent tranformation S of m × n matrices X over F where(X)S = A ^TX + XB. Using module-theoretic concepts a Jordan basis for S is specified recursively in terms of the representations of m and n in the scale of p, and reduction formulae for the elementary divisors of S are established.     

On the extreme eigenvalues of hermitian (block) toeplitz matrices

We are concerned with the behavior of the minimum (maximum) eigenvalue λ₀⁽ⁿ⁾ (λ_n⁽ⁿ⁾) of an (n + 1) × (n + 1) Hermitian Toeplitz matrix T_n(ƒ) where ƒ is an integrable real-valued function. Kac, Murdoch, and Szegö, Widom, Parter, and R. H. Chan obtained that λ₀⁽ⁿ⁾ — min ƒ = O(1/n^2k) in the case where ƒ C^2k, at least locally, and ƒ — inf ƒ has a zero of order 2k. We obtain the same result under the second hypothesis alone. Moreover we develop a new tool in order to estimate the extreme eigenvalues of the mentioned matrices, proving that the rate of convergence of λ₀⁽ⁿ⁾ to inf ƒ depends only on the order ρ (not necessarily even or integer or finite) of the zero of ƒ — inf ƒ. With the help of this tool, we derive an absolute lower bound for the minimal eigenvalues of Toeplitz matrices generated by nonnegative L¹ functions and also an upper bound for the associated Euclidean condition numbers. Finally, these results are extended to the case of Hermitian block Toeplitz matrices with Toeplitz blocks generated by a bivariate integrable function ƒ.     

An inequality for M-matrices

If AB are n × n M matrices with dominant principal diagonal, we show that 3[det(A + B)]^1/n ≥ (det A)^1/n + (det B)^1/n.     

Chapter 3:inertia preservers

Let Vdenote either the space of n×n hermitian matrices or the space of n×nreal symmetric matrices, Given nonnegative integers r,s,t such that r+S+t=n, let G( r,s,r) denote the set of all matrices in V with inertia (r,s,t). We consider here linear operators on V which map G(r,s,t) into itself.     

On the limit of a product of matrix exponentials

The existence of the limit as ε→0 exp[(A+B/ε)t] exp[-Bt/ε]is studied for n×n matrices A,B. Necessary and sufficient conditions on B that the limit exist for all A are given.     

The maximun of i(XAX-1+B)

Let F be an algebraically closed field. We denote by i(A) the number of invariant polynomials of a square matrix A, which are different from 1. For A,B any n×n matrices over F, we calculate the maximum of i(XAX^-1+B), where X runs over the set of all non-singular n×n matrices over F.     

Commutativity preserving linear maps and Lie automorphisms of strictly triangular matrix space

In this paper we classify linear maps preserving commutativity in both directions on the space N(F) of strictly upper triangular (n+1)×(n+1) matrices over a field F. We show that for n3 a linear map on N(F) preserves commutativity in both directions if and only if =^′+f where ^′ is a product of standard maps on N(F) and f is a linear map of N(F) into its center.     

An extremal problem concerning matrices of 0's and 1 's

We determine the smallest number f(n,k) such that every (0,1)-matrix of order n what zero main diagonal which has at least f(n,k) 1's contains an irreducible, principal submatrix of order K. We characterize those matrices with f(n,k)-1 l's having no irreducible, principal submatrix of order k     

Sums and products of matrices with prescribed similarity classes

Let F be a field and let A and n × n matrices over F. We study some properties of A^' + B^' and A^'B^', when A^' and B^' run over the sets of the matrices similar to A and B, respectively.     

On the inertia of the Lyapunov transform AH+HA* for H >0

Given an arbitrary n×n matrix A with complex entries, we characterize all inertia triples (abc) that are attained by the Lyapunov transform AH+ HA^*, as H varies over the set of all n× n positive definite matrices.     

Products of involutory matrices. I

It is shown that, for every integer ≥1 and every field F, each n×n matrix over F of determinant ±1 is the product of four involutory matrices over F. Products of three ×n involutory matrices over F are characterized for the special cases where n≤4 or F has prime order ≤5. It is also shown for every field F that every matrix over F of determinant ±1 having no more than two nontrivial invariant factors is a product of three involutory matrices over F.     

Caractérisation spectrale de la forme de Jordan

Soit , où désigne l'ensemble des matrices n×n à coefficients complexes. Nous montrons qu'on peut complètement caractériser la forme de Jordan de A en examinant le polynôme caractéristique de tA+X pour tous les tC et tous les . Ceci nous permet de donner une démonstration plus élémentaire d'un théorème de Baribeau et Ransford sur les transformations holomorphes de qui préservent le spectre.

Denote by the set of complex n×n matrices, and let . We give a variational, purely spectral characterization of the Jordan form of A by examining the characteristic polynomial of the perturbed matrices tA+X for tC and . This allows us to give a more elementary proof of a theorem of Baribeau and Ransford on spectrum-preserving holomorphic maps on .     

A formula for the number of Latin squares

We establish an explicit formula for the number of Latin squares of order n:

, where B_n is the set of n×n(0,1) matrices, σ₀(A is the number of zero elements of the matrix A and per A is the permanent of the matrix A.     

Minimum permanents of doubly stochastic matrices with at least one zero entry

It is shown that the minimum value of the permanent on the n× ndoubly stochastic matrices which contain at least one zero entry is achieved at those matrices nearest to J_nin Euclidean norm, where J_nis the n× nmatrix each of whose entries is n^-1. In case n ≠ 3 the minimum permanent is achieved only at those matrices nearest J_n; for n= 3 it is achieved at other matrices containing one or more zero entries as well.     

Finding all essential terms of a characteristic maxpolynomial

Let us denote ab=max(a,b) and ab=a+b for and extend this pair of operations to matrices and vectors in the same way as in linear algebra. We present an O(n²(m+n log n)) algorithm for finding all essential terms of the max-algebraic characteristic polynomial of an n×n matrix over with m finite elements. In the cases when all terms are essential, this algorithm also solves the following problem: Given an n×n matrix A and k{1,…,n}, find a k×k principal submatrix of A whose assignment problem value is maximum.     

Between d-stability and sign-stability: the 3 × 3 case

[2] introduced a decreasing sequence of sets of real n × n matrices, which begins with the D-stable matrices and stops at the sign-stable matrices. It is not clear how many of the n sets in the sequence are distinct. This article documents the disappointment that in the first case where the sequence could contain a set which is neither the D-stable matrices nor the sign-stable matrices(viz., the case n = 3) it doesn't.     

Topological properties of orthostochastic matrices

The set of n×n orthostochastic matrices with the topology induced by the Euclidean matric is shown to be compact and path-connected. For n<3, the set of orthostochastic matrices is identical to the set of doubly stochastic matrices. In this paper, it is shown that for n3 the orthostochastic matrices are not everywhere dense in the set of doubly stochastic matrices, thus answering a question of L. Mirsky in his survey article on doubly stochastic matrices [2].     

Multiplicative properties of generalized matrix functions

We consider scalar-valued matrix functions for n×n matrices A=(a_ij) defined by Where G is a subgroup of S_n the group of permutations on n letters, and χ is a linear character of G. Two such functions are the permanent and the determinant. A function (1) is multiplicative on a semigroup S of n×n matrices if d(AB)=d(A)d(B) AB∈S.

With mild restrictions on the underlying scalar ring we show that every element of a semigroup containing the diagonal matrices on which (1) is multiplicative can have at most one nonzero diagonal(i.e., diagonal with all nonzero entries)and conversely, provided that χ is the principal character(χ≡1).     

Ranks of Solutions of the Matrix Equation AXB = C

The purpose of this article is to solve two problems related to solutions of a consistent complex matrix equation AXB = C : (I) the maximal and minimal ranks of solution to AXB = C , and (II) the maximal and minimal ranks of two real matrices X₀ and X₁ in solution X = X₀ + iX₁ to AXB = C . As applications, the maximal and minimal ranks of two real matrices C and D in generalized inverse (A + iB)^- = C + iD of a complex matrix A + iB are also examined.