The similarity problem for 3−3 integer matrices

Using results from the similarity problem of 2?2 integer matrices, we derive an algorithm for the solution of the similarity problem for 3?3 integer matrices.     

Miniversal deformations of matrices of bilinear forms

Arnold [V.I. Arnold, On matrices depending on parameters, Russian Math. Surveys 26 (2) (1971) 29–43] constructed miniversal deformations of square complex matrices under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it can be reduced by similarity transformations that smoothly depend on the entries of B. We construct miniversal deformations of matrices under congruence.     

矩阵代数上保持与正矩阵的相似性的可加满射

用M_n表示n×n复矩阵代数(n≥2),给出M_n上双边保与正矩阵的相似性的可加满射的完全刻画和分类.     

On the matrix algebra of elliptic biquaternions

In this study, we introduce the concept of elliptic biquaternion matrices. Firstly, we obtain elliptic matrix representations of elliptic biquaternion matrices and establish a universal similarity factorization equality for elliptic biquaternion matrices. Afterwards, with the aid of these representations and this equality, we obtain various results on some basic topics such as generalized inverses, eigenvalues and eigenvectors, determinants, and similarity of elliptic biquaternion matrices. These valuable results may be useful for developing a perfect theory on matrix analysis over elliptic biquaternion algebra in the future.     

Reachability of condensed forms via unitary congruence transformations

There are several well-known facts about unitary similarity transformations of complex n-by-n matrices: every matrix of order n = 3 can be brought to tridiagonal form by a unitary similarity transformation; if n ≥ 5, then there exist matrices that cannot be brought to tridiagonal form by a unitary similarity transformation; for any fixed set of positions (pattern) S whose cardinality exceeds n(n ? 1)/2, there exists an n-by-n matrix A such that none of the matrices that are unitarily similar to A can have zeros in all of the positions in S. It is shown that analogous facts are valid if unitary similarity transformations are replaced by unitary congruence ones.     

Similarity of operator blocks and canonical forms. I. General results,feedback equivalence and kronecker indices

In the present paper the problem of classifying blocks of matrices up to similarity is considered. The notion of block similarity used here is a natural generalization of similarity for matrices. The invariants are described and canonical forms are given. This theory of block-similarity provides a general framework, which includes the state feedback theory for systems, the theory of Kronecker equivalence and a similarity theory for non-everywhere defined operators. New applications, in particular to factorization problems, are also obtained.     

Similarity transformations of decomposable matrix polynomials and related questions

A relationship is found between the similarity transformations of decomposable matrix polynomials with relatively prime elementary divisors and the equivalence transformations of the corresponding matrices with scalar entries. Matrices with scalar entries are classified with respect to equivalence transformations based on direct sums of lower triangular almost Toeplitz matrices. This solves the similarity problem for a special class of finite matrix sets over the field of complex numbers. Eventually, this problem reduces to the one of special diagonal equivalence between matrices. Invariants of this equivalence are found.     

Reduction of matrices by means of equivalent transformations and similarity transformations

The structure of polynomial matrices in connection with their reducibility by semiscalar-equivalent transformations and similarity transformations to simpler forms is considered. In particular, the canonical form of polynomial matrices without multiple characteristic roots with respect to the above transformations is indicated. This allows one to establish a canonical form with respect to similarity for a certain type of finite collections of numerical matrices. Translated fromMatematicheskie Zametki, Vol. 64, No. 5, pp. 769–782, November, 1998.     

Similarity of block diagonal and block triangular matrices

It is shown that if a block triangular matrix is similar to its block diagonal part, then the similarity matrix can be chosen of the block triangular form. An analogous statement is proved for equivalent matrices. For the simplest case of 2×2 block matrices these results were obtained by W.Roth [1]. It is shown that all these results do not admit a generalization for the infinite dimensional case.     

Signature preserving linear maps of Hermitian matrices

The structure of a unital linear map on hermitian matrices with the property that it preserves the set of invertible hermitian matrices with fixed indefinite inertia is examined. It turns out that such a map is either a unitary similarity or a unitary similarity followed by a transposition (the case when the fixed inertia has equal number of positive and negative eigenvalues is excluded).     

关于幂等阵的相似与线性组合

证明了数域上两个同阶幂等阵相似的充要条件是它们有相同的秩;给出了幂等阵的相似标准型;讨论了两个幂等阵的线性组合仍是幂等阵的充要条件.     

λ-矩阵的若干性质及应用

本文主要从数字矩阵具有的合同关系和相似关系等性质入手,定义并讨论λ-矩阵的合同关系和相似关系,并讨论它们的性质．     

Similarity of matrices over local rings

Wasow investigated the problem of when, for a pair of matrices of analytic functions, pointwise similarity implies analytic similarity. By using the topology of Spec R, this is studied for an arbitrary commutative ring. Results of Wasow, Ohm, Schneider, and Friedland are generalized in this setting. A canonical form is determined for matrices satisfying the Wasow condition.     

Similarity invariants for matrices over a commutative Artinian chain ring

Suppose that R is a commutative Artinian chain ring, A is an m × m matrix over R, and S is a discrete valuation ring such that R is a homomorphic image of S. We consider m ideals in the polynomial ring over S that are similarity invariants for matrices over R, i.e., these ideals coincide for similar matrices. It is shown that the new invariants are stronger than the Fitting invariants, and that new invariants solve the similarity problem for 2 × 2 matrices over R.     

Roth's theorems for sets of matrices

It is shown that Roth's theorems on the equivalence and similarity of block diagonal matrices hold for finite sets of matrices over a commutative ring.     

Composition of binary integral quadratic forms via integral 2 × 2 matrices and composition of matrix classes

A treatment by integral matrices is given for composition of pairs of integral quadratic forms with the same discriminant. The forms are associated with a pair of similar 2 × 2 matrices AB with irrational eigen values which generate the maximal order. The most general integral similarity between AB is given by a matrix whose entries are linear forms in two indeterminates with integral coefficients. This matrix is a "compositum" of two factors of the same nature. By equating determinants a composition of two quadratic forms results. The method can be generalized to n × n matrices.     

对角占优矩阵奇异-非奇异的充分必要判据

本文研究对角占优矩阵奇异-非奇异的充分必要条件.基于Taussky定理,本文得出,可约对角占优矩阵的奇异性由其独立Frobenius块的奇异性决定,从而将这一问题化为不可约对角占优矩阵的奇异-非奇异性问题;运用Taussky定理研究奇异不可约对角占优矩阵的相似性和酉相似性,获得这类矩阵元素辐角间的关系;并与Taussky定理给出的这类矩阵元素模之间的关系结合在一起,研究不可约对角占优矩阵奇异的充分必要条件;最后给出不可约对角占优矩阵奇异-非奇异性的判定方法.     

利用有限域上2-幂零矩阵构作Cartesian认证码

给出 2 -幂零矩阵的Jordan标准型在相似变换下的稳定群的结构 ,利用有限域上 2 -幂零矩阵构作了一个Cartesian认证码 ,计算出了该认证码的参数 .在假定编码规则按等概率分布选取的条件下 ,计算出了该认证码被成功的模仿攻击的最大概率PI 及被成功的替换攻击的最大概率PS.     

A matriceal analogue of Fejer's theory

J. Arazy [1] pointed out that there is a similarity between functions defined on the torus and infinite matrices. In this paper we discuss and develop in the framework of matrices Fejer's theory for Fourier series.