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.     

On convertible (0,1) matrices

A square matrix A with per A≠0 is called convertible if there exists a (1, -1) matrix H such that per A=det(H o A) where H o A denote the Hadamard product of H and A In this paper, an upper bound of permanents of maximal convertible (0,1) matrices A with π(A)≥4(n-1) is obtained.     

Convexoid and generalized derivations

Let E,F be two Banach spaces and let S be a symmetric norm ideal of L(E,F). For AL(F) and BL(E) the generalized derivation δ_S,A,B is the operator on S that sends X to AX−XB. A bounded linear operator is said to be convexoid if its (algebraic) numerical range coincides with the convex hull of its spectrum. We show that δ_S,A,B is convexoid if and only if A and B are convexoid.     

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.     

A theorem of the alternatives for the equation Ax + B|x| = b

The following theorem is proved: given square matrices A, D of the same size, D nonnegative, then either the equation Ax + B|x| = b has a unique solution for each B with |B| ≤ D and for each b, or the equation Ax + B₀|x| = 0 has a nontrivial solution for some matrix B₀ of a very special form, |B₀| ≤ D; the two alternatives exclude each other. Some consequences of this result are drawn. In particular, we define a λ to be an absolute eigenvalue of A if |Ax| = λ|x| for some x ≠ 0, and we prove that each square real matrix has an absolute eigenvalue.     

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

A result on integral symmetric matrices

Let A be an integral matrix such that det A = 1 mod mA ≡ A^T mod m, where m is odd. It is shown that a symmetric integral matrix B of determinant 1 exists such that B ≡ A mod m. The result is false if m is even.     

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 note on linearization of actions of finitely semisimple Hopf algebras on local algebras

Let H be a Hopf algebra over a field k and let H A → A, h a → h.a, be an action of H on a commutative local Noetherian kalgebra (A, m). We say that this action is linearizable if there exists a minimal system x₁, …, x_n of generators of the maximal ideal m such that h.x_i ε kx₁ + …+ kx_n for all h ε H and i = 1, …, n. In the paper we prove that the actions from a certain class are linearizable (see Theorem 4), and we indicate some consequences of this fact.     

Some inequalities for commutators and an application to spectral variation. II

Inequalities that compare unitarily invariant norms of A - B and those of AΓ - ΓB and Γ^-1A - B Γ^-1 are obtained, where both A and B are either Hermitian or unitary or normal operators and Γ is a positive definite operator in a complex separable Hilbert space. These inequalities are then applied to derive bounds for spectral variation of diagonalisable matrices. Our new bounds improve substantially previously published bounds.     

Some involutory similarities

Matrices A,B over an arbitrary field F, when given to be similar to each other, are shown to be involutorily similar (over F) to each other (i.e.B = CAC^-1for some C = C^-1over F) in the following cases: (1)B= aI - Afor some a ε F and (2) B = A^-1. Result (2) for the cases where char F ≠ 2 is essentially a 1966 result of Wonenburger.     

Numerical ranges and dilations

Denote by W(A) the numerical range of a bounded linear operator A. For two operators A and B (which may act on different Hilbert spaces), we study the relation between the inclusion relation W(A)⊆W(B) and the condition that A can be dilated to an operator of the form B⊗I. We also investigate the possibilities of dilating an operator A to operators with simple structure under the assumption that W(A) is included in a special region.     

A new class of fuzzy implications. Axioms of fuzzy implication revisited

Many different fuzzy implication operators have been proposed; most of them fit into one of the two classes: implication operations that are based on an explicit representation of implication A → B in terms of &, , and ¬ (e.g., S-implications that are based on the formula B ¬ A), and R-implications that are based on an implicit representation of implication A → B as the weakest C for which C&B implies A. However, some fuzzy implication operations (such as b^a) cannot be naturally represented in this form. To describe such operations, we propose a new (third) class of implication operations called A-implications whose relation to &, , and ¬ is described by (implicit) axioms.     

Primes in the semigroup of non-negative matrices

A matrix A in the semigroup N_n of non-negative n×nmatrices is prime if A is not monomial and A=BC,BCεN_n implies that either B or C is monomial. One necessary and another sufficient condition are given for a matrix in N_n to be prime. It is proved that every prime in N_n is completely decomposable.     

The growth of laguerre matrix polynomials on bounded intervals

Let A be a matrix in ^r×r such that Re(z) > −1/2 for all the eigenvalues of A and let {π_n^(A,1/2) (x)} be the normalized sequence of Laguerre matrix polynomials associated with A. In this paper, it is proved that π_n^(A,1/2) (x) = O(n^(A)/2ln^r−1(n)) and π_n+1^(A,1/2) (x) − π_n^(A,1/2) (x) = O(n^((A)−1)/2ln^r−1(n)) uniformly on bounded intervals, where (A) = max{Re(z); z eigenvalue of A}.     

The chromatic difference sequence of the Cartesian product of graphs

The chromatic difference sequence cds(G) of a graph G with chromatic number n is defined by cds(G) = (a(1), a(2),…, a(n)) if the sum of a(1), a(2),…, a(t) is the maximum number of vertices in an induced t-colorable subgraph of G for t = 1, 2,…, n. The Cartesian product of two graphs G and H, denoted by G□H, has the vertex set V(G□H = V(G) x V(H) and its edge set is given by (x₁, y₁)(x₂, y₂) ε E(G□H) if either x₁ = x₂ and y₁ y₂ ε E(H) or y₁ = y₂ and x₁x₂ ε E(G).

We obtained four main results: the cds of the product of bipartite graphs, the cds of the product of graphs with cds being nondrop flat and first-drop flat, the non-increasing theorem for powers of graphs and cds of powers of circulant graphs.     

Linear mappings which are rank-k nonincreasing, II

We prove the following result. Let F be an infinite field of characteristic other than two. Let k be a positive integer. Let S_n(F) denote the space of all n × n symmetric matrices with entries in F, and let T:S_n(F)→S_n(F) be a linear operator. Suppose that T is rank-k nonincreasing and its image contains a matrix with rank higher than K. Then, there exist λεF and PεF^n,n such that T(A)=λPAP^t for all AεS_n(F). λ can be chosen to be 1 if F is algebraically closed and ±1 if F=R, the real field.     

Polynomials in a matrix

Let A be a matrixp(x) a polynomial. Put B=p(A). It is shown that necessary and sufficient conditions for A to be a polynomial in B are (i) if λ is any eigenvalue of A, and if some elementary divisor of A corresponding to λ is nonlinear, thenp^'(λ)≠0;and (ii) if λ,μ are distinct eigenvalues of A, then p(λ)p(μ) are also distinct. Here all computations are over some algebraically closed field.