Some generators for the algebra of n×n matrices

In this note, we show how the algebra of n×n matrices over a field can be generated by a pair of matrices AB, where A is an arbitrary nonscalar matrix and B can be chosen so that there is the maximum degree of linear independence between the higher commutators of B with A.     

Linear operators that preserve pairs of matrices which satisfy extreme rank properties

A pair of m×n matrices (A,B) is called rank-sum-maximal if rank(A+B)=rank(A)+rank(B), and rank-sum-minimal if rank(A+B)=|rank(A)−rank(B)|. We characterize the linear operators that preserve the set of rank-sum-minimal matrix pairs, and the linear operators that preserve the set of rank-sum-maximal matrix pairs over any field with at least min(m,n)+2 elements and of characteristic not 2.     

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.     

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.     

Linear transformations on matrices: The invariance of commuting pairs of matrices

Let L be a linear transformation on the set of all n×n matrices over an algebraically closed field of characteristic 0. It is shown that if AB=BA implies L(A)L(B)=L(B)L(A) and if either L is nonsingular or the implication in the hypothesis can also be reversed, then L is a sum of a scalar multiple of a similarity transformation and a linear functional times the identity transformation.     

A result about determinantal divisors

Let Rbe a principal ideal ringR_n the ring of n× nmatrices over R, and d_k(A) the kth determinantal divisor of Afor 1 ≤ k≤ n, where Ais any element of R_n, It is shown that if A,BεR_n, det(A) det(B:) ≠ 0, then d_k(AB) ≡ 0 mod d_k(A) d_k(B). If in addition (det(A), det(B)) = 1, then it is also shown that d_k(AB) = d_k(A) d_k(B). This provides a new proof of the multiplicativity of the Smith normal form for matrices with relatively prime determinants.     

An approximate, multivariable version of Specht's theorem

In this article we provide generalizations of Specht's theorem which states that two n × n matrices A and B are unitarily equivalent if and only if all traces of words in two non-commuting variables applied to the pairs (A, A*) and (B, B*) coincide. First, we obtain conditions which allow us to extend this to simultaneous similarity or unitary equivalence of families of operators, and secondly, we show that it suffices to consider a more restricted family of functions when comparing traces. Our results do not require the traces of words in (A, A*) and (B, B*) to coincide, but only to be close.     

Linear Operators that Preserve Commuting Pairs of Nonnegative Real Matrices

A pair of n×n matrices (A, B) is called a commuting pair if AB=BA. We characterize the linear operators that preserve the set of commuting pairs of matrices over a subsemiring of nonnegative real numbers.     

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.     

A matrix problem associated with computing Cohen-Macaulay type

Suppose A∈M_n×m(F), B∈M_n×t(F) for some field F. Define Г(AB) to be the set of n×n diagonal matrices D such that the column space of DA is contained in the column space of B. In this paper we determine dim Г(AB). For matrices AB of the same rank we provide an algorithm for computing dim Г(AB).     

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.     

On a conjecture of C. Johnson

Given a pair of n×n matricesA and B, one may form a polynomial P(A,B,λ) which generalizes the characteristic polynomial of BP(B,λ). In particular, when A=I (identity), P(A, B,λ) = P(B,λ), the characteristic polynomial of B. C. Johnson has conjectured [1] (among other things) that when A and B are hermitian and A is positive definite, then P(A,B,λ) has real roots. The case n=2 can be done by hand. In this paper we verify the conjecture for n=3.     

A characterization of linear transformations which leave the doubly stochastic matrices

A characterization of linear transformations which leave the n×n doubly stochastic matrices invariant is given as a linear combination of functions of the type T(X)=AXB with certain restrictions posed on the n×n matrices A and B.     

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.     

A note on feedback cyclicity of C[Y]

Let (A,B) be an n-dimensional linear system with 2-inputs over C[Y], the ring of polynomials in one-variable over the field of complex numbers. We prove the feedback cyclicity of (A,B) under certain conditions on their entries and deduce that (A,B) is feedback cyclic in an exceptional case left open in W. Schmale [Linear Algebra Appl. 275–276 (1998) 551–562].     

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).     

The identity as a matrix commutator

If A is an n×n matrix over a field F of positive characteristic p, then I_n=AB-BA, for some matrix B, iff p divides the size of each Jordan block of A.     

Direct fail-proof triangularization algorithms for AX + XB = C with Error-Free and parallel implementations

Two 0(mn³) inversion-free direct algorithms to compute a solution of the linear system AX +XB = C by triangularizing a Hessenberg matrix are presented. Without any loss of generality the matrix A is assumed upper Hessenberg and the order m of A the order n of B. The algorithms have an in-built consistency check, are capable of pruning redundant rows and converting the resulting matrix into a full row rank matrix, and permit A and —B to be any square matrices with common or distinct eigenvalues. In addition, these algorithms can also solve the homogeneous system AX +XB = 0 (null matrix C). An error-free implementation of the solution X using multiple modulus residue arithmetic as well as a parallelization of the algorithms is discussed.     

On determining the congruence of point sets in d dimensions

This paper considers the following problem: given two point sets A and B (|A| = |B| = n) in d dimensional Euclidean space, determine whether or not A is congruent to B. This paper presents an O(n^(d−1)/2 log n) time randomized algorithm. The birthday paradox, which is well-known in combinatorics, is used effectively in this algorithm. Although this algorithm is Monte-Carlo type (i.e., it may give a wrong result), this improves a previous O(n^d−2 log n) time deterministic algorithm considerably. This paper also shows that if d is not bounded, the problem is at least as hard as the graph isomorphism problem in the sense of the polynomiality. Several related results are described too.     

A note on the relation between the determinant and the permanent

In this note we prove that there is no linear mapping T on the space of n-square symmetric matrices over any subfield of real field such that the determinant of A is equal to the permanent of T(A) for all symmetric matrices A if n≥3.