广义模糊幂零矩阵

路代数是加法幂等的半环,它包括了布尔代数,模糊代数,分配格及斜坡.因此布尔矩阵,模糊矩阵,格矩阵及斜矩阵都是路代数上的典型矩阵.广义模糊幂零矩阵指的就是路代数上的幂零矩阵.在2010年,Tan研究了路代数上矩阵的幂零性.在Tan的基础上继续讨论了路代数上幂零矩阵的幂零指数.     

Set inertia-preserving matrices

The inertia-preservers of several sets of matrices are identified. The sets include: all real matrices, all complex matrices, triangular matrices, real symmetric matrices and Hermitian matrices.     

Hyponormal and strongly hyponormal matrices in inner product spaces

Complex matrices that are structured with respect to a possibly degenerate indefinite inner product are studied. Based on earlier works on normal matrices, the notions of hyponormal and strongly hyponormal matrices are introduced. A full characterization of such matrices is given and it is shown how those matrices are related to different concepts of normal matrices in degenerate inner product spaces. Finally, the existence of invariant semidefinite subspaces for strongly hyponormal matrices is discussed.     

Set inertia-preserving matrices∗ †

The inertia-preservers of several sets of matrices are identified. The sets include: all real matrices, all complex matrices, triangular matrices, real symmetric matrices and Hermitian matrices.     

Inversion of polynomial and rational matrices

The inversion of polynomial and rational matrices is considered. For regular matrices, three algorithms for computing the inverse matrix in a factored form are proposed. For singular matrices, algorithms of constructing pseudoinverse matrices are considered. The algorithms of inversion of rational matrices are based on the minimal factorization which reduces the problem to the inversion of polynomial matrices. A class of special polynomial matrices is regarded whose inverse matrices are also polynomial matrices. Inversion algorithms are applied to the solution of systems with polynomial and rational matrices. Bibliography: 3 titles. Translated by V. N. Kublanovskaya. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 202, 1992, pp. 97–109.     

A quasiseparable approach to five-diagonal CMV and Fiedler matrices

Recent work in the characterization of structured matrices in terms of characteristic polynomials of principal submatrices is furthered in this paper. Some classical classes of matrices with quasiseparable structure include tridiagonal (related to real orthogonal polynomials) and banded matrices, unitary Hessenberg matrices (related to Szegö polynomials), and semiseparable matrices, as well as others. Hence working with the class of quasiseparable matrices provides new results which generalize and unify classical results.Previous work has focused on characterizing (H,1)-quasiseparable matrices, matrices with order-one quasiseparable structure that are also upper Hessenberg. In this paper, the authors introduce the concept of a twist transformation, and use such transformations to explain the relationship between (H,1)-quasiseparable matrices and the subclass of (1,1)-quasiseparable matrices (without the upper Hessenberg restriction) which are related to the same systems of polynomials. These results generalize the discoveries of Cantero, Fiedler, Kimura, Moral and Velázquez of five-diagonal matrices related to Horner and Szegö polynomials in the context of quasiseparable matrices.     

Determinants of matrices over semirings

In this paper, the concept of determinants for the matrices over a commutative semiring is introduced, and a development of determinantal identities is presented. This includes a generalization of the Laplace and Binet–Cauchy Theorems, as well as on adjoint matrices. Also, the determinants and the adjoint matrices over a commutative difference-ordered semiring are discussed and some inequalities for the determinants and for the adjoint matrices are obtained. The main results in this paper generalize the corresponding results for matrices over commutative rings, for fuzzy matrices, for lattice matrices and for incline matrices.     

REPRINT OF: A quasiseparable approach to five-diagonal CMV and Fiedler matrices

Recent work in the characterization of structured matrices in terms of characteristic polynomials of principal submatrices is furthered in this paper. Some classical classes of matrices with quasiseparable structure include tridiagonal (related to real orthogonal polynomials) and banded matrices, unitary Hessenberg matrices (related to Szegö polynomials), and semiseparable matrices, as well as others. Hence working with the class of quasiseparable matrices provides new results which generalize and unify classical results.Previous work has focused on characterizing (H,1)-quasiseparable matrices, matrices with order-one quasiseparable structure that are also upper Hessenberg. In this paper, the authors introduce the concept of a twist transformation, and use such transformations to explain the relationship between (H,1)-quasiseparable matrices and the subclass of (1,1)-quasiseparable matrices (without the upper Hessenberg restriction) which are related to the same systems of polynomials. These results generalize the discoveries of Cantero, Fiedler, Kimura, Moral and Velázquez of five-diagonal matrices related to Horner and Szegö polynomials in the context of quasiseparable matrices.     

Constructing self-orthogonal and Hermitian self-orthogonal codes via weighing matrices and orbit matrices

We define the notion of an orbit matrix with respect to standard weighing matrices, and with respect to types of weighing matrices with entries in a finite field. In the latter case we primarily restrict our attention the fields of order 2, 3 and 4. We construct self-orthogonal and Hermitian self-orthogonal linear codes over finite fields from these types of weighing matrices and their orbit matrices respectively. We demonstrate that this approach applies to several combinatorial structures such as Hadamard matrices and balanced generalized weighing matrices. As a case study we construct self-orthogonal codes from some weighing matrices belonging to some well known infinite families, such as the Paley conference matrices, and weighing matrices constructed from ternary periodic Golay pairs.     

On the generalized indices of boolean matrices

We characterize completely those Boolean matrices with the largest generalized indices in the class of Boolean matrices and in the class of reducible Boolean matrices and derive a new upper bound for the generalized index in terms of period. We also generalize the upper and lower multiexponents of primitive Boolean matrices to general Boolean matrices.     

Sums of nilpotent matrices

We study matrices over general rings which are sums of nilpotent matrices. We show that over commutative rings all matrices with nilpotent trace are sums of three nilpotent matrices. We characterize 2-by-2 matrices with integer entries which are sums of two nilpotents via the solvability of a quadratic Diophantine equation. Some exemples in the case of matrices over noncommutative rings are given.     

立体阵的一般结构

本文给出了立体阵的各种表示形式及立体阵乘法的各种定义,推导出其主要性质,说明立体阵的乘积在适当情况下可转化成普通矩阵乘积。然后讨论了立体阵的乘积与矩阵半张量积的关系,并用矩阵半张量积统一了各种立体阵的乘法运算。最后以对策论为例说明它的应用。     

加强p除环上自共轭矩阵的几个定理

本文将实对称矩阵和复Hermiitian环矩阵,以及更特殊的正定与半正定矩阵的一些较为深入的定理推广到加强p除上矩阵中来.     

On the generalized indices of boolean matrices

We characterize completely those Boolean matrices with the largest generalized indices in the class of Boolean matrices and in the class of reducible Boolean matrices and derive a new upper bound for the generalized index in terms of period. We also generalize the upper and lower multiexponents of primitive Boolean matrices to general Boolean matrices.     

关于Toeplitz矩阵的某些注记

In this paper,we study real symmetric Toeplitz matrices commutable with tridi-agonal matrices, present more detailed results than those in [1], and extend them to non-symmetric Toeplitz matrices. Also, complex Toeplitz matrices, especially the corresponding matrices of lower order, are discussed.     

Binary Representation of Normalized Symmetric and Correlation Matrices

With a view toward the correlation matrices, it is shown that the normalized real symmetric matrices are the affine hull of the binary correlation matrices, while the convex hull is a proper subset of the correlation matrices. A number of ways to identify the correlation matrices in the affine hull are discussed.     

Binary Representation of Normalized Symmetric and Correlation Matrices

With a view toward the correlation matrices, it is shown that the normalized real symmetric matrices are the affine hull of the binary correlation matrices, while the convex hull is a proper subset of the correlation matrices. A number of ways to identify the correlation matrices in the affine hull are discussed.     

On the finiteness property for rational matrices

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product. It was conjectured a decade ago that all finite sets of real matrices have the finiteness property. This “finiteness conjecture” is now known to be false but no explicit counterexample is available and in particular it is unclear if a counterexample is possible whose matrices have rational or binary entries. In this paper, we prove that all finite sets of nonnegative rational matrices have the finiteness property if and only if pairs of binary matrices do and we state a similar result when negative entries are allowed. We also show that all pairs of 2×2 binary matrices have the finiteness property. These results have direct implications for the stability problem for sets of matrices. Stability is algorithmically decidable for sets of matrices that have the finiteness property and so it follows from our results that if all pairs of binary matrices have the finiteness property then stability is decidable for nonnegative rational matrices. This would be in sharp contrast with the fact that the related problem of boundedness is known to be undecidable for sets of nonnegative rational matrices.     

Eigenvalue perturbation theory of symplectic,orthogonal, and unitary matrices under generic structured rank one perturbations

We study the perturbation theory of structured matrices under structured rank one perturbations, with emphasis on matrices that are unitary, orthogonal, or symplectic with respect to an indefinite inner product. The rank one perturbations are not necessarily of arbitrary small size (in the sense of norm). In the case of sesquilinear forms, results on selfadjoint matrices can be applied to unitary matrices by using the Cayley transformation, but in the case of real or complex symmetric or skew-symmetric bilinear forms additional considerations are necessary. For complex symplectic matrices, it turns out that generically (with respect to the perturbations) the behavior of the Jordan form of the perturbed matrix follows the pattern established earlier for unstructured matrices and their unstructured perturbations, provided the specific properties of the Jordan form of complex symplectic matrices are accounted for. For instance, the number of Jordan blocks of fixed odd size corresponding to the eigenvalue 1 or ?1 have to be even. For complex orthogonal matrices, it is shown that the behavior of the Jordan structures corresponding to the original eigenvalues that are not moved by perturbations follows again the pattern established earlier for unstructured matrices, taking into account the specifics of Jordan forms of complex orthogonal matrices. The proofs are based on general results developed in the paper concerning Jordan forms of structured matrices (which include in particular the classes of orthogonal and symplectic matrices) under structured rank one perturbations. These results are presented and proved in the framework of real as well as of complex matrices.