Characterization of chaotic order and its application to furuta inequality

In this note, we give a simple characterization of the chaotic order among positive invertible operators on a Hilbert space. As an application, we discuss Furuta's type operator inequality.

     

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.     

Doubly stochastic matrices whose powers eventually stop

In this note we characterize doubly stochastic matrices A whose powers A,A²,A³,… eventually stop, i.e., A^p=A^p+1= for some positive integer p. The characterization enables us to determine the set of all such matrices.     

Positive diagonal solutions to the Lyapunov equations

We study various stability type conditions on a matrix A related to the consistency of the Lyapunov equation AD+DA^t positive definite, where D is a positive diagonal matrix. Such problems arise in mathematical economics, in the study of time-invariant continuous-time systems and in the study of predator-prey systems. Using a theorem of the alternative, a characterization is given for all A satisfying the above equation. In addition, some necessary conditions for consistency and some related ideas are discussed. Finally, a method for constructing a solution D to the equation is given for matrices A satisfying certain conditions.     

Spectral variation under congruence

In this paper we study the possible spectra among matrices congruent to a given AεM_n(C). It is important to distinguish singular A from nonsingular and, among non-singular matrices, to distinguish where 0 lies relative to the field of values 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.     

A Note of log A ≥log B

In this paper,firstty we shall show some equivalent conditions of A＞B＞0;secondly by using the results of ours we shall show some characterizations of the chaotic order(i.e.,log A≥log B)by norm inequalities.     

On operator order and chaotic operator order for two operators

In this paper we characterize operator order A?B?O and chaotic operator order log A?logB for positive and invertible operators A and B in terms of operator inequalities via the Furuta inequality and operator equalities due to the Douglas’s majorization and factorization. Related results are obtained, which include generalizations and characterizations of some well-known results.     

Extremal patterns of distinct entries in vectors in the range of a matrix

For an m × n matrix A over a field F we consider the following quantities: μ(A), the maximum multiplicity of a field element as a component of a nonzero vector in the range of A, and δ(A), the minimum number of distinct entries in a nonzero vector in the range of A. In terms of ramk(A), we describe the set of possible values of μand δ and discuss the possible relations between them. We also develop a general affine geometric structure in which the sets of values of μ and δ may be characterized linear algebraically.     

The semigroup generated by a unitary orbit of a singular matrix

We investigate the structure of the multiplicative semigroup generated by the set of matrices that are unitarily equivalent to a given singular matrix A. In particular, we give necessary and sufficient conditions, in terms of the singular values of A, for such a semigroup to consist of all matrices of rank not exceeding the rank of A.     

A characterization and representation of the generalized inverse AT,S and its applications

This paper presents an explicit expression for the generalized inverse A⁽²⁾_T,S. Based on this, we established the characterization, the representation theorem and the limiting process for A⁽²⁾_T,S. As an application, we estimate the error bound of the iterative method for approximating A⁽²⁾_T,S.     

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.     

Characterization of supercommuting matrices

For a given n-by-n matrix A, we consider the set of matrices which commute with A and all of whose principal submatrices commute with the corresponding principal submatrices of A. The properties of this set are examined, with particular attention to its dimension.     

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.     

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.     

Backward error bounds for approximate Krylov subspaces

Let A be a matrix of order n and let be a subspace of dimension k. In this note, we determine a matrix E of minimal norm such that is a Krylov subspace of A+E.     

A note on sign-solvability of linear system of equations

Given an n×(n+I) sign matrix (Ab). we are concerned with the condition that guarantees the solution to Ax=b be of a fixded sign pattern. It is shown that each factor of det (1) corresponds. in aone to one way to DM-component of the bipartite graph representation of A. This fact is used to supplement the proof of the graph-theoretic characterization of sign-solvability obtained by Bassett et al. [1] and subsequent authors.     

A stable range for quadratic forms over commutative rings

A commutative ring A has quadratic stable range 1 (qsr(A) = 1) if each primitive binary quadratic form over A represents a unit. It is shown that qsr(A) = 1 implies that every primitive quadratic form over A represents a unit, A has stable range 1 and finitely generated constant rank projectives over A are free. A classification of quadratic forms is provided over Bezout domains with characteristic other than 2, quadratic stable range 1, and a strong approximation property for a certain subset of their maximum spectrum. These domains include rings of holomorphic functions on connected noncompact Riemann surfaces. Examples of localizations of rings of algebraic integers are provided to show that the classical concept of stable range does not behave well in either direction under finite integral extensions and that qsr(A) = 1 does not descend from such extensions.     

Highly symmetric generalized circulant permutation matrices

In this paper we investigate generalized circulant permutation matrices of composite order. We give a complete characterization of the order and the structure of symmetric generalized k-circulant permutation matrices in terms of circulant and retrocirculant block (0, 1)-matrices in which each block contains exactly one or two entries 1. In particular, we prove that a generalized k-circulant matrix A of composite order n = km is symmetric if and only if either k = m − 1 or k ≡ 0 or k ≡ 1 mod m, and we obtain three basic symmetric generalized k-circulant permutation matrices, from which all others are obtained via permutations of the blocks or by direct sums. Furthermore, we extend the characterization of these matrices to centrosymmetric matrices.     

一个关于多个算子的保序不等式(英文)

本文研究了Furuta型算子不等式问题.利用Lwner-Heinz不等式和Uchiyama不等式,把关于两个算子的保序不等式推广为多个算子的情形,从而推广了Furuta的结果.