A theorem concerning certain sign symmetric matrices whose inverses are Morishima

Suppose A is an invertible sign symmetric matrix whose associated digraph D(A) is a tree. Then A^-1 will be Morishima iff a^?? ? 0 for all interior points ? in D(A). A^-1 will be anti-Morishima iff a^?? ? 0 for all interior points ? in D(A).     

Some results concerning invertible Morishima and anti-Morishima matrices whose associated digraphs are trees

This paper addresses the following questions: Given that A is an invertible Morishima or anti-Morishima matrix, under what conditions will A^-1 be a Morishima or anti-Morishima matrix? Also, given the associated digraph of A and the fact that A, A^-1 are Morishima or anti-Morishima matrices, what can be said about the digraph of A^-1? A class of matrices is introduced where there questions are investigated.     

Construction and nonnegativity of sign idempotent sign pattern matrices

In this paper, we modify Eschenbach’s algorithm for constructing sign idempotent sign pattern matrices so that it correctly constructs all of them. We find distinct classes of sign idempotent sign pattern matrices that are signature similar to an entrywise nonnegative sign pattern matrix. Additionally, if for a sign idempotent sign pattern matrix A there exists a signature matrix S such that SAS is nonnegative, we prove such S is unique up to multiplication by -1 if the signed digraph D(A) is not disconnected.     

The period and base of a reducible sign pattern matrix

A square sign pattern matrix A (whose entries are ) is said to be powerful if all the powers A,A²,A³,…, are unambiguously defined. For a powerful pattern A, if A^l=A^l+p with l and p minimal, then l is called the base of A and p is called the period of Li et al. [On the period and base of a sign pattern matrix, Linear Algebra Appl. 212/213 (1994) 101-120] characterized irreducible powerful sign pattern matrices. In this paper, we characterize reducible, powerful sign pattern matrices and give some new results on the period and base of a powerful sign pattern matrix.     

Graph-theoretical approach to qualitative solvability of linear systems

The structure of sign-solvable and strongly sign-solvable systems is studied here by a refinement of the graph-theoretic approach first suggested by Maybee. Both sign-solvability and strong sign-solvability are characterized in terms of an associated digraph. The problem of recognizing sign-solvability is reduced to two subproblems: recognizing strong sign-solvability and recognizing sign-nonsingularity. Under fairly general conditions on the sign patterns of A, it is possible to determine all sign patterns for b which render the system Ax = b sign-solvable.     

Algebraic properties of isometries between groups of invertible elements in Banach algebras

We prove that an isometry T between open subgroups of the invertible groups of unital Banach algebras A and B is extended to a real-linear isometry up to translation between these Banach algebras. While a unital isometry between unital semisimple commutative Banach algebras need not be multiplicative, we prove in this paper that if A is commutative and A or B are semisimple, then (T(eA))⁻¹T is extended to an isometric real algebra isomorphism from A onto B. In particular, A−1 is isometric as a metric space to B−1 if and only if they are isometrically isomorphic to each other as metrizable groups if and only if A is isometrically isomorphic to B as a real Banach algebra; it is compared by the example of ?elazko concerning on non-isomorphic Banach algebras with the homeomorphically isomorphic invertible groups. Isometries between open subgroups of the invertible groups of unital closed standard operator algebras on Banach spaces are investigated and their general forms are given.     

Finite criteria for conditional definiteness of quadratic forms

A real symmetric n × n matrix Q is A-conditionally positivesemidefinite, where A is a given m × n matrix, if x′Qx?0 whenever Ax?0, and is A-conditionally positive definite if strict inequality holds except when x=0. When A is the identity matrix these notions reduce to the well-studied notions of copositivity and strict copositivity respectively. This paper presents finite criteria, involving only the solution of sets of linear equations constructed from the matrices Q,A, for testing both types of conditional definiteness. These criteria generalize known facts about copositive matrices and, when Q is invertible and all row submatrices of A have maximal rank, can be very elegantly stated in terms of Schur complements of the matrix AQ^-1A′.     

Arc transitive covering digraphs and their eigenvalues

We prove that every finite regular digraph has an arc-transitive covering digraph (whose arcs are equivalent under automorphisms) and every finite regular graph has a 2-arc-transitive covering graph. As a corollary, we sharpen C. D. Godsil's results on eigenvalues and minimum polynomials of vertex-transitive graphs and digraphs. Using Godsil's results, we prove, that given an integral matrix A there exists an arc-transitive digraph X such that the minimum polynomial of A divides that of X. It follows that there exist arc-transitive digraphs with nondiagonalizable adjacency matrices, answering a problem by P. J. Cameron. For symmetric matrices A, we construct a 2-arc-transitive graphs X.     

On the covariance of the Moore-Penrose inverse

Given a square complex matrix A with Moore-Penrose inverse A², we describe the class of invertible matrices T such that (TAT^-1)²=TA²T^-1.     

G-matrices,J-orthogonal matrices,and their sign patterns

A real matrix A is a G-matrix if A is nonsingular and there exist nonsingular diagonal matrices D₁ and D₂ such that A^?T = D₁AD₂, where A^?T denotes the transpose of the inverse of A. Denote by J = diag(±1) a diagonal (signature) matrix, each of whose diagonal entries is +1 or ?1. A nonsingular real matrix Q is called J-orthogonal if Q^TJQ = J. Many connections are established between these matrices. In particular, a matrix A is a G-matrix if and only if A is diagonally (with positive diagonals) equivalent to a column permutation of a J-orthogonal matrix. An investigation into the sign patterns of the J-orthogonal matrices is initiated. It is observed that the sign patterns of the G-matrices are exactly the column permutations of the sign patterns of the J-orthogonal matrices. Some interesting constructions of certain J-orthogonal matrices are exhibited. It is shown that every symmetric staircase sign pattern matrix allows a J-orthogonal matrix. Sign potentially J-orthogonal conditions are also considered. Some examples and open questions are provided.     

Transposing a matrix by similarity operations

A matrix T is said to co-transpose a square matrix A if T^?1AT=A′ and T^?1A′T=A. For every n?3 there exists a real n×n matrix which cannot be co-transposed by any matrix. However, it is shown that the following classes of real matrices can be co-transposed by a symmetric matrix of order two: 2×2 matrices, normal matrices, and matrices whose square is symmetric.     

Upper triangularization of matrices by permutations and lower triangular similarity transformations

Let A be an arbitary (square) matrix. As is well known, there exists an invertible matrix S such that S^-1AS is upper triangular. The present paper is concerned with the observation that S can always be chosen in the form S=∏L, where ∏ is a permutation matrix and L is lower triangular. Assuming that the eigenvalues of A are given, the matrices ∏, L, and U=L^-1∏^-1A∏L are constructed in an explicit way. The construction gives insight into the freedom one has in choosing the permutation matrix ∏. Two cases where ∏ can be chosen to be the identity matrix are discussed (A diagonable, A a low order Toeplitz matrix). There is a connection with systems theory.     

The recognition of the class of indecomposable digraphs under low hemimorphy

Given a digraph G=(V,A), the subdigraph of G induced by a subset X of V is denoted by G[X]. With each digraph G=(V,A) is associated its dual G^?=(V,A^?) defined as follows: for any x,y∈V, (x,y)∈A^? if (y,x)∈A. Two digraphs G and H are hemimorphic if G is isomorphic to H or to H^?. Given k>0, the digraphs G=(V,A) and H=(V,B) are k-hemimorphic if for every X⊆V, with |X|≤k, G[X] and H[X] are hemimorphic. A class C of digraphs is k-recognizable if every digraph k-hemimorphic to a digraph of C belongs to C. In another vein, given a digraph G=(V,A), a subset X of V is an interval of G provided that for a,b∈X and x∈V−X, (a,x)∈A if and only if (b,x)∈A, and similarly for (x,a) and (x,b). For example, 0?, {x}, where x∈V, and V are intervals called trivial. A digraph is indecomposable if all its intervals are trivial. We characterize the indecomposable digraphs which are 3-hemimorphic to a non-indecomposable digraph. It follows that the class of indecomposable digraphs is 4-recognizable.     

On the relation between an operator and its self-commutator

We show that a bounded operator A on a Hilbert space belongs to a certain set associated with its self-commutator [A^?,A], provided that A−zI can be approximated by invertible operators for all complex numbers z. The theorem remains valid in a general C^?-algebra of real rank zero under the assumption that A−zI belong to the closure of the connected component of unity in the set of invertible elements. This result implies the Brown-Douglas-Fillmore theorem and Huaxin Lin?s theorem on almost commuting matrices. Moreover, it allows us to refine the former and to extend the latter to operators of infinite rank and other norms (including the Schatten norms on the space of matrices). The proof is based on an abstract theorem, which states that a normal element of a C^?-algebra of real rank zero satisfying the above condition has a resolution of the identity associated with any open cover of its spectrum.     

Combinatorial Yang–Baxter maps arising from the tetrahedron equation

We survey the matrix product solutions of the Yang–Baxter equation recently obtained from the tetrahedron equation. They form a family of quantum R-matrices of generalized quantum groups interpolating the symmetric tensor representations of U_q(A_n?1⁽¹⁾) and the antisymmetric tensor representations of \({U_{ - {q^{ - 1}}}}\left( {A_{n - 1}^{\left( 1 \right)}} \right)\). We show that at q = 0, they all reduce to the Yang–Baxter maps called combinatorial R-matrices and describe the latter by an explicit algorithm.     

Nash-solvable two-person symmetric cycle game forms

A two-person positional game form g (with perfect information and without moves of chance) is modeled by a finite directed graph (digraph) whose vertices and arcs are interpreted as positions and moves, respectively. All simple directed cycles of this digraph together with its terminal positions form the set A of the outcomes. Each non-terminal position j is controlled by one of two players i∈I={1,2}. A strategy x_i of a player i∈I involves selecting a move (j,j^′) in each position j controlled by i. We restrict both players to their pure positional strategies; in other words, a move (j,j^′) in a position j is deterministic (not random) and it can depend only on j (not on preceding positions or moves or on their numbers). For every pair of strategies (x₁,x₂), the selected moves uniquely define a play, that is, a directed path form a given initial position j₀ to an outcome (a directed cycle or terminal vertex). This outcome a∈A is the result of the game corresponding to the chosen strategies, a=a(x₁,x₂). Furthermore, each player i∈I={1,2} has a real-valued utility function u_i over A. Standardly, a game form g is called Nash-solvable if for every u=(u₁,u₂) the obtained game (g,u) has a Nash equilibrium (in pure positional strategies).A digraph (and the corresponding game form) is called symmetric if (j,j^′) is its arc whenever (j^′,j) is. In this paper we obtain necessary and sufficient conditions for Nash-solvability of symmetric cycle two-person game forms and show that these conditions can be verified in linear time in the size of the digraph.     

Sign patterns that require almost unique rank

A sign pattern matrix is a matrix whose entries are from the set {+,-,0}. 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). For a sign pattern matrix A, the sign pattern class of A, denoted Q(A), is defined as {B:sgn(B)=A}. The minimum rank mr(A) (maximum rank MR(A)) of a sign pattern matrix A is the minimum (maximum) of the ranks of the real matrices in Q(A). Several results concerning sign patterns A that require almost unique rank, that is to say, the sign patterns A such that MR(A) = mr(A) + 1, are established and are extended to sign patterns A for which the spread is d=MR(A)-mr(A). A complete characterization of the sign patterns that require almost unique rank is obtained.     

Rational realization of the minimum ranks of nonnegative sign pattern matrices

A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set {+,?, 0} ({+, 0}, respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix A is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of A. Using a correspondence between sign patterns with minimum rank r ≥ 2 and point-hyperplane configurations in R^r?1 and Steinitz’s theorem on the rational realizability of 3-polytopes, it is shown that for every nonnegative sign pattern of minimum rank at most 4, the minimum rank and the rational minimum rank are equal. But there are nonnegative sign patterns with minimum rank 5 whose rational minimum rank is greater than 5. It is established that every d-polytope determines a nonnegative sign pattern with minimum rank d + 1 that has a (d + 1) × (d + 1) triangular submatrix with all diagonal entries positive. It is also shown that there are at most min{3m, 3n} zero entries in any condensed nonnegative m × n sign pattern of minimum rank 3. Some bounds on the entries of some integer matrices achieving the minimum ranks of nonnegative sign patterns with minimum rank 3 or 4 are established.