Search

The signed enhanced principal rank characteristic sequence (sepr-sequence) of an Hermitian matrix is the sequence , where is either , , , , , , or , based on the following criteria: if B has both a positive and a negative order-k principal minor, and each order-k principal minor is nonzero. (respectively, ) if each order-k principal minor is positive (respectively, negative). if each order-k principal minor is zero. if B has each a positive, a negative and a zero order-k principal minor. (respectively, ) if B has both a zero and a nonzero order-k principal minor, and each nonzero order-k principal minor is positive (respectively, negative). Such sequences provide more information than the epr-sequence in the literature, where the kth term is either , , or based on whether all, none, or some (but not all) of the order-k principal minors of the matrix are nonzero. Various sepr-sequences are shown to be unattainable by Hermitian matrices. In particular, by applying Muir’s law of extensible minors, it is shown that subsequences such as and are prohibited in the sepr-sequence of a Hermitian matrix. For Hermitian matrices of orders , all attainable sepr-sequences are classified. For real symmetric matrices, a complete characterization of the attainable sepr-sequences whose underlying epr-sequence contains as a non-terminal subsequence is established. [ABSTRACT FROM AUTHOR]

In this paper, the solvability conditions and the explicit expressions of the Hermitian solutions to the system of matrix equations and the Hermitian nonnegative definite solutions to the system of matrix equations are, respectively, put forward, by making full use of the generalized inverse and the rank of matrices. As applications, some special cases of the above systems of matrix equations are considered. In addition, the maximal ranks and inertias of the Hermitian solutions are, respectively, presented. [ABSTRACT FROM PUBLISHER]

Fundamental theorem of geometry of hermitian matrices characterizes all bijective maps on the space of all hermitian matrices, which preserve adjacency in both directions. In this and subsequent paper we characterize maps on the set of all invertible hermitian matrices over a finite field, which preserve adjacency in one direction. In this first paper it is shown that maps that preserve adjacency on the set of all invertible hermitian matrices over a finite field are necessarily bijective, so the corresponding graph on invertible hermitian matrices, where edges are defined by the adjacency relation, is a core. Besides matrix theory, the proof relies on results from several other mathematical areas, including spectral and chromatic graph theory, and finite geometry. [ABSTRACT FROM AUTHOR]

The enhanced principal rank characteristic sequence (epr-sequence) of a symmetric n × n matrix is a sequence ℓ 1 ℓ 2 ⋯ ℓ n where ℓ k is A , S , or N according as all, some, or none of its principal minors of order k are nonzero. Such sequences give more information than the (0,1) pr-sequences previously studied (where basically the k th entry is 0 or 1 according as none or at least one of its principal minors of order k is nonzero). Various techniques including the Schur complement are introduced to establish that certain subsequences such as NAN are forbidden in epr-sequences over fields of characteristic not two. Using probabilistic methods over fields of characteristic zero, it is shown that any sequence of A s and S s ending in A is attainable, and any sequence of A s and S s followed by one or more N s is attainable; additional families of attainable epr-sequences are constructed explicitly by other methods. For real symmetric matrices of orders 2, 3, 4, and 5, all attainable epr-sequences are listed with justifications. [ABSTRACT FROM AUTHOR]

In this note, we characterize linear maps between spaces of Hermitian matrices over a field with involution which preserve the rank of the identity matrix and the rank of tensor products of rank one Hermitian matrices. It is assumed that the fixed field with respect to the field with involution has at least four elements. We also present some applications of our main result to other preserver problems. [ABSTRACT FROM AUTHOR]

Given an n × n matrix, its principal rank characteristic sequence is a sequence of length n + 1 of 0s and 1s where, for k = 0 , 1 , … , n , a 1 in the k th position indicates the existence of a principal submatrix of rank k and a 0 indicates the absence of such a submatrix. The principal rank characteristic sequences for symmetric matrices over various fields are investigated, with all such attainable sequences determined for all n over any field with characteristic 2. A complete list of attainable sequences for real symmetric matrices of order 7 is reported. [ABSTRACT FROM AUTHOR]

Abstract: In this paper, we discuss the minimal rank of when X is Hermitian by applying singular value decomposition and some rank equalities of matrices, and obtain a representation of the minimal rank. Based on the representation, we obtain necessary and sufficient conditions for the matrix equation to have Hermitian solutions. [Copyright &y& Elsevier]

A complex square matrix A is called an orthogonal projector if A 2 = A = A*, where A* is the conjugate transpose of A. In this article, we first give some formulas for calculating the distributions of real eigenvalues of a linear combination of two orthogonal projectors. Then, we establish various expansion formulas for calculating the inertias, ranks and signatures of some 2 × 2 and 3 × 3, as well as k × k block Hermitian matrices consisting of two orthogonal projectors. Many applications of the formulas are presented in characterizing interval distributions of numbers of eigenvalues, and nonsingularity of these block Hermitian matrices. In addition, necessary and sufficient conditions are given for various equalities and inequalities of these block Hermitian matrices to hold. [ABSTRACT FROM PUBLISHER]

Abstract: We investigate constant rank subspaces of symmetric and hermitian matrices over finite fields, using a double counting method related to the number of common zeros of the corresponding subspaces of symmetric bilinear and hermitian forms. We obtain optimal bounds for the dimensions of constant rank subspaces of hermitian matrices, and good bounds for the dimensions of subspaces of symmetric and hermitian matrices whose non-zero elements all have odd rank. [Copyright &y& Elsevier]

Abstract: This paper gives a group of expansion formulas for the inertias of Hermitian matrix polynomials , and through some congruence transformations for block matrices, where A is a Hermitian matrix. Then, the paper derives various expansion formulas for the ranks and inertias of some matrix pencils generated from two or three orthogonal projectors and Hermitian unitary matrices. As applications, the paper establishes necessary and sufficient conditions for many matrix equalities to hold, as well as many inequalities in the Löwner partial ordering to hold. [Copyright &y& Elsevier]

We introduce a simultaneous decomposition for a matrix triplet ( A, B, C), where A=± A and (⋅) denotes the conjugate transpose of a matrix, and use the simultaneous decomposition to solve some conjectures on the maximal and minimal values of the ranks of the matrix expressions A− BXC±( BXC) with respect to a variable matrix X. In addition, we give some explicit formulas for the maximal and minimal values of the inertia of the matrix expression A− BXC−( BXC) with respect to X. As applications, we derive the extremal ranks and inertias of the matrix expression D− CXC subject to Hermitian solutions of a consistent matrix equation AXA= B, as well as the extremal ranks and inertias of the Hermitian Schur complement D− B A B with respect to a Hermitian generalized inverse A of A. Various consequences of these extremal ranks and inertias are also presented in the paper. [ABSTRACT FROM AUTHOR]

Abstract: The inertia of a Hermitian matrix is defined to be a triplet composed of the numbers of the positive, negative and zero eigenvalues of the matrix counted with multiplicities, respectively. In this paper, we show some basic formulas for inertias of block Hermitian matrices. From these formulas, we derive various equalities and inequalities for inertias of sums, parallel sums, products of Hermitian matrices, submatrices in block Hermitian matrices, differences of outer inverses of Hermitian matrices. As applications, we derive the extremal inertias of the linear matrix expression with respect to a variable Hermitian matrix X. In addition, we give some results on the extremal inertias of Hermitian solutions to the matrix equation , as well as the extremal inertias of a partial block Hermitian matrix. [Copyright &y& Elsevier]

Abstract: It is shown that any map which preserves adjacency on hermitian matrices over a finite field is necessary bijective and hence of the standard form. [Copyright &y& Elsevier]

Suppose [image omitted] is a field with proper involution and of arbitrary characteristic. Additive maps, which do not increase rank-one on hermitian matrices with entries from [image omitted] are classified. The result is then used to classify additive maps that do not increase minimal rank on the set of symmetric elements, relative to general involution on a matrix algebra. [ABSTRACT FROM AUTHOR]