Some generalizations of diagonal dominance associated with G-functions

The concept of a G-function introduced by Nowosad and Hoffman is used to characterize classes of complex square matrices, resulting from various degrees of diagonal dominance associated with G-functions. Their relationship to the set of M-matrices is established.     

Schur-type stability properties and complex diagonal scaling

We introduce new classes of n-by-n matrices with complex entries which can be scaled by a diagonal matrix with complex entries to be normal or Hermitian and study the Schur-type stability properties of these matrices.     

Classes of functions and feasibility conditions in nonlinear complementarity problems

Given a mappingF from real Euclideann-space into itself, we investigate the connection between various known classes of functions and the nonlinear complementarity problem: Find anx ^* such thatFx ^* ? 0 andx ^* ? 0 are orthogonal. In particular, we study the extent to which the existence of au ? 0 withFu ? 0 (feasible point) implies the existence of a solution to the nonlinear complementarity problem, and extend, to nonlinear mappings, known results in the linear complementarity problem on P-matrices, diagonally dominant matrices with non-negative diagonal elements, matrices with off-diagonal non-positive entries, and positive semidefinite matrices.     

Linear maps preserving regional eigenvalue location

Let M(n, C) be the vector space of n × n complex matrices and let G(r,s,t) be the set of all matrices in M(n, C) having r eigenvalues with positive real parts eigenvalues with negative real part and t eigenvalues with zero real part. In particularG(0,n,0) is the set of stable matrices. We investigate the set of linear operators on M(n, C) that map G(r,s,t) into itself. Such maps include, but are not always limited to similarities, transposition, and multiplication by a positive constant. The proof of our results depends on a characterization of nilpotent matrices in terms of matrices in a particular G(r,s,t), and an extension of a result about the existence of a matrix with prescribed eigenstructure and diagonal entries. Each of these results is of independent interest. Moreover, our char-acterization of nilpotent matrices is sufficiently general to allow us to determine the preservers of many other "inertia classes."     

INERTIA SETS OF SYMMETRIC SIGN PATTERN MATRICES

1　IntroductionIn qualitative and combinatorial matrix theory,we study properties ofa matrix basedon combinatorial information,such as the signs of entries in the matrix.A matrix whoseentries are from the set{ + ,-,0 } is called a sign pattern matrix ( or sign pattern,or pat-tern) .We denote the setof all n× n sign pattern matrices by Qn.For a real matrix B,sgn( B) is the sign pattern matrix obtained by replacing each positive( respectively,negative,zero) entry of B by+ ( respectively,-,0 )…     

Linear transformations that preserve certain positivity classes of matrices

For each of several S ? R^n,n, those linear transformations $\text{L}\text{: R}{}^{\mathrm{n,n}}\text{→ R}{}^{\mathrm{n,n}}$ which map S onto S are characterized. Each class is a familiar one which generalizes the notion of positivity to matrices. The classes include: the matrices with nonnegative principal minors, the M-matrices, the totally nonnegative matrices, the D-stable matrices, the matrices with positive diagonal Lyapunov solutions, and the H-matrices, as well as other related classes. The set of transformations is somewhat different from case to case, but the strategy of proof, while differing in detail, is similar.     

M-matrix characterizations.I—nonsingular M-matrices

The purpose of this survey is to classify systematically a widely ranging list of characterizations of nonsingular M-matrices from the economics and mathematics literatures. These characterizations are grouped together in terms of their relations to the properties of (1) positivity of principal minors, (2) inverse-positivity and splittings, (3) stability and (4) semipositivity and diagonal dominance. A list of forty equivalent conditions is given for a square matrix A with nonpositive off-diagonal entries to be a nonsingular M-matrix. These conditions are grouped into classes in order to identify those that are equivalent for arbitrary real matrices A. In addition, other remarks relating nonsingular M-matrices to certain complex matrices are made, and the recent literature on these general topics is surveyed.     

When the positivity of the leading principal minors implies the positivity of all principal minors of a matrix

An n-by-n real matrix A enjoys the “leading implies all” (LIA) property, if, whenever D   is a diagonal matrix such that A+D$A+D$ has positive leading principal minors (PMs), all PMs of A are positive. Symmetric and Z-matrices are known to have this property. We give a new class of matrices (“mixed matrices”) that both unifies and generalizes these two classes and their special diagonal equivalences by also having the LIA property. “Nested implies all” (NIA) is also enjoyed by this new class.     

Congruence Criteria for Finite Subsets of Quaternionic Elliptic and Quaternionic Hyperbolic Spaces

We investigate congruence classes of m-tuples of points in the quaternionic elliptic space ?P ⁿ . We establish a canonical bijection between the set of congruence classes of m-tuples of points in ?P ⁿ and the set of equivalence classes of positive semidefinite Hermitian m×m matrices of rank at most n+1 with the 1's on the diagonal. We show that with each m-tuple of points in ?P ⁿ is associated a tuple of points on the real unit sphere S ². Then we get that the congruence class of an m-tuple of points in ?P ⁿ is determined by the congruence classes of all its triangles and by the direct congruence class of the associated tuple on the sphere S ² provided that no pair of points of the m-tuple has distance π/2. Finally we carry out the same kind of investigation for the quaternionic hyperbolic space ?H ⁿ . Most of the results are completely analogous, although there are also some interesting differences.     

On two classes of matrices with positive diagonal solutions to the Lyapunov equation

We characterize real indecomposable quasi-Jacobi matrices of class $\text{D}$, i.e., those which satisfy the Lyapunov equation PA + A′P = ?Q with P diagonal and both P and Q positive definite. The subclass $\text{D}$₂ (of class $\text{D}$) when also Q is diagonal is also characterized in the case of general indecomposable real matrices.     

Flows on graphs applied to diagonal similarity and diagonal equivalence for matrices

Three equivalence relations are considered on the set of n × n matrices with elements in F₀, an abelian group with absorbing zero adjoined. They are the relations of diagonal similarity, diagonal equivalence, and restricted diagonal equivalence. These relations are usually considered for matrices with elements in a field. But only multiplication is involved. Thus our formulation in terms of an abelian group with o is natural. Moreover, if F is chosen to be an additive group, diagonal similarity is characterized in terms of flows on the pattern graph of the matrices and diagonal equivalence in terms of flows on the bipartie graph of the matrices. For restricted diagonal equivalence a pseudo-diagonal of the graph must also be considered. When no pseudo-diagonal is present, the divisibility properties of the group F play a role. We show that the three relations are characterized by cyclic, polygonal, and pseudo-diagonal products for multiplicative F. Thus, our method of reducing propositions concerning the three equivalence relations to propositions concerning flows on graphs, provides a unified approach to problems previously considered independently, and yields some n, w or improved results. Our consideration of cycles rather than circuits eliminates certain restrictions (e.g., the complete reducibility of the matrices) which have previously been imposed. Our results extend theorems in Engel and Schneider [5], where however the group F is permitted to be non-commutative.     

Resonance in equations with a diagonal field

Let A be a real square matrix, and let J?$\text{R}$ be an interval not containing an eigenvalue of A. Is A–D nonsingular for all diagonal matrices D with entries d_i ∈J? This holds if A is symmetric, but is not true in general. We prove a necessary condition and indicate implications for an equation with a diagonal field.     

Some hypergraphs and packing problems associated with matrices of 0's and 1's

We define various classes of hypergraphs associated with m × n matrices of 0's and 1's and determine for which classes the maximum cardinality of a set of pairwise disjoint edges equals the minimum cardinality of a set of nodes that cover all edges independently of the matrix.     

Note on a conjecture of Kojima and Saigal

We prove there exist a finite set of (real) matrices of order n with positive determinant that, collectively, “see” all such matrices.     

Normal dilatation of triangular matrices

LetR be a (real or complex) triangular matrix of ordern, say, an upper triangular matrix. Is it true that there exists a normaln×n matrixA whose upper triangle coincides with the upper triangle ofR? The answer to this question is “yes” and is obvious in the following cases: (1)R is real; (2)R is a complex matrix with a real or a pure imaginary main diagonal, and moreover, all the diagonal entries ofR belong to a straight line. The answer is also in the affirmative (although it is not so obvious) for any matrixR of order 2. However, even forn=3 this problem remains unsolved. In this paper it is shown that the answer is in the affirmative also for 3×3 matrices.     

On a conjecture of R.A. Brualdi

Brualdi's conjecture on the minimum permanent in the set of doubly stochastic n × n matrices with n − 1 zeros on a diagonal is shown to be false for n ⩾ 5. The minimum is determined in a subset of such matrices.     

Theorems on partitioned matrices revisited and their applications to graph spectra

Some old results about spectra of partitioned matrices due to Goddard and Schneider or Haynsworth are re-proved. A new result is given for the spectrum of a block-stochastic matrix with the property that each off-diagonal block has equal entries and each diagonal block has equal diagonal entries and equal off-diagonal entries. The result is applied to the study of the spectra of the usual graph matrices by partitioning the vertex set of the graph according to the neighborhood equivalence relation. The concept of a reduced graph matrix is introduced. The question of when n-2 is the second largest signless Laplacian eigenvalue of a connected graph of order n is treated. A recent conjecture posed by Tam, Fan and Zhou on graphs that maximize the signless Laplacian spectral radius over all (not necessarily connected) graphs with given numbers of vertices and edges is refuted. The Laplacian spectrum of a (degree) maximal graph is reconsidered.     

On the accuracy of the Gerschgorin circle theorem for bounding the spread of a real symmetric matrix

The spread of a matrix with real eigenvalues is the difference between its largest and smallest eigenvalues. The Gerschgorin circle theorem can be used to bound the extreme eigenvalues of the matrix and hence its spread. For nonsymmetric matrices the Gerschgorin bound on the spread may be larger by an arbitrary factor than the actual spread even if the matrix is symmetrizable. This is not true for real symmetric matrices. It is shown that for real symmetric matrices (or complex Hermitian matrices) the ratio between the bound and the spread is bounded by $\text{p+1}$, where p is the maximum number of off diagonal nonzeros in any row of the matrix. For full matrices this is just $\text{n}$. This bound is not quite sharp for n greater than 2, but examples with ratios of $\text{n?1}$ for all n are given. For banded matrices with m nonzero bands the maximum ratio is bounded by $\text{m}$ independent of the size of n. This bound is sharp provided only that n is at least 2m. For sparse matrices, p may be quite small and the Gerschgorin bound may be surprisingly accurate.