Computer generated numerical ranges and some resulting theorems

The numerical rangeW(A), of an arbitrary n-square matrix A is the union of the numerical ranges of all 2-square real compressions of A. As a result, a simple graphics program is written that accurately exhibits W(A) for real A, and suggests several conjectures relating the geometry of W(A) to algebraic properties of A. Some of these conjectures are analyzed in the final sections of the paper.     

Strong 3-commutativity preserving maps on standard operator algebras

Let X be a Banach space of dimension ≥ 2 over the real or complex field F and A a standard operator algebra in B(X). A map Φ :A →A is said to be strong 3-commutativity preserving if [Φ(A), Φ(B)]3 = [A,B]3 for all A,B∈ A, where[A,B]3 is the 3-commutator of A,B defined by[A, B]3 = [[[A, B],B],B] with [A,B] = AB-BA. The main result in this paper is shown that.,if Φ is a surjective map on A, then Φ is strong 3-commutativity preserving if and only if there exist a functional h : A →F and a scalar λ∈ F with λ~4 = 1 such that Φ(A)=λ A+h(A)I for all A ∈ A.     

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.     

Quaternionic Numerical Range and Real Subspaces

Let W(A) be the numerical range of an n × n quaternionic matrix A and V a real subspace of the skew field of real quaternions. In this note the authors consider the relation among the shape of W(A), the convexity of V∩W(A): and the validity of the equality V∩W(A) = W_v(A), where W_v (A) is the orthogonal projection of W(A) into V.     

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.     

Fuzzy semirings

In this paper we initiate the study of fuzzy semirings and fuzzy A-semimodules where A is a semiring and A-semimodules are representations of A. In particular, semirings all of whose ideals are idempotent, called fully idempotent semirings, are investigated in a fuzzy context. It is proved, among other results, that a semiring A is fully idempotent if and only if the lattice of fuzzy ideals of A is distributive under the sum and product of fuzzy ideals. It is also shown that the set of proper fuzzy prime ideals of a fully idempotent semiring A admits the structure of a topological space, called the fuzzy prime spectrum of A.     

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

Nonchordal positive semidefinite stochastic matrices

Let K_nbe the convex set of n×npositive semidefinite doubly stochastic matrices. If Aε k_n, the graph of A,G(A), is the graph on n vertices with (i,j) an edge if a_ij ≠ 0i≠ j. We are concerned with the extreme points in K_n. In many cases, the rank of Aand G(A) are enough to determine whether A is extreme in K_n. This is true, in particular, if G(A)is a special kind of nonchordal graph, i.e., if no two cycles in G(A)have a common edge.     

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.     

The robertson-taussky inequality revisited

Let a positive definite Hermitian matrix HεMⁿ(C) be decomposed as H=A + iB, with A, B ε M_nm(R). We give two new proofs of the inequality det H ≤ det A (with equality iff B = 0. each of which vields something futher. One exhibits majorization between the eigenvalues of A and H the other allows proof of the permanental analog per H≥per A.     

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 on n-critical economical generalized tic-tac-toe games

There is a so called generalized tic-tac-toe game playing on a finite set X with winning sets A₁, A₂,…, A_m. Two players, F and S, take in turn a previous untaken vertex of X, with F going first. The one who takes all the vertices of some winning set first wins the game. Erd s and Selfridge proved that if |A₁|=|A₂|==|A_m|=n and m<2ⁿ⁻¹, then the game is a draw. This result is best possible in the sense that once m=2ⁿ⁻¹, then there is a family A₁, A₂,…, A_m so that F can win. In this paper we characterize all those sets A₁,…, A_2n−1 so that F can win in exactly n moves. We also get similar result in the biased games.     

Nonnegative matrices having same nonnegative moore-penrose and group inverses

Nonnegative matrices A whose Moore-Penrose generalized inverse A⁺ is nonnegative and has any one of the three equivalent properties (i) AA⁺ = A⁺A (ii) A⁺ = A, the group inverse, (iii) A⁺ = p(A), some polynomial in A with scalar coefficients, are characterized. This characterization generalizes known results on nonnegative matrices Awhose Moore-Penrose generalized inverse is equal to some power of A.     

Some results on symplectic matrices

The principal results are that if A is an integral matrix such that AA^T is symplectic then A = CQ, where Q is a permutation matrix and C is symplectic; and that if A is a hermitian positive definite matrix which is symplectic, and B is the unique hermitian positive definite pth.root of A, where p is a positive integer, then B is also symplectic.     

Spherical functions and immanants

Let λ be an irreducible character of S_n corresponding to the partition (r,s) of n. Let A be a positive semidefinite Hermitian n × n matrix. Let d_λ(A) and per(A) be the immanants corresponding to λ and to the trivial character of S_n, respectively. A proof of the inequality dλ(A)≤λ(id)per(A) is given.     

Some explicit formulas for the polynomial decomposition of the matrix exponential and applications

This paper is devoted to the study of some formulas for polynomial decomposition of the exponential of a square matrix A. More precisely, we suppose that the minimal polynomial M_A(X) of A is known and has degree m. Therefore, e^tA is given in terms of P₀(A),…,P_m−1(A), where the P_j(A) are polynomials in A of degree less than m, and some explicit analytic functions. Examples and applications are given. In particular, the two cases m=5 and m=6 are considered.     

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.     

An identity for the determinant

When the directed graph of an n-by-n matrix A does not contain a Hamilton cycle, we exhibit a formula for det A in terms of sums of products of proper principal minors of A. The set of minors involved depends upon the zero/nonzero pattern of A.     

Equality of higher numerical ranges of matrices and a conjecture of Kippenhahn on Hermitian pencils

Let M_n be the algebra of all n × n complex matrices. For 1 k n, the kth numerical range of A M_n is defined by W_k(A) = (1/k)∑_j^k=1x_j^*Ax_j : x₁, …, x_k is an orthonormal set in ⁿ]. It is known that tr A/n = W_n(A) W_n−1(A) W₁(A). We study the condition on A under which W_m(A) = W_k(A) for some given 1 m < k n. It turns out that this study is closely related to a conjecture of Kippenhahn on Hermitian pencils. A new class of counterexamples to the conjecture is constructed, based on the theory of the numerical range.