On reducible matrix patterns

A tool to study the inertias of reducible nonzero (resp. sign) patterns is presented. Sumsets are used to obtain a list of inertias attainable by the pattern 𝒜 ⊕ ? dependent upon inertias attainable by patterns 𝒜 and ?. It is shown that if ? is a pattern of order n, and 𝒜 is an inertially arbitrary pattern of order at least 2(n ? 1), then 𝒜 ⊕ ? is inertially arbitrary if and only if ? allows the inertias (0, 0, n), (0, n, 0) and (n, 0, 0). We illustrate how to construct other reducible inertially (resp. spectrally) arbitrary patterns from an inertially (resp. spectrally) arbitrary pattern 𝒜 ⊕ ?, by replacing 𝒜 with an inertially (resp. spectrally) arbitrary pattern 𝒮. We identify reducible inertially (resp. spectrally) arbitrary patterns of the smallest orders that contain some irreducible components that are not inertially (resp. spectrally) arbitrary. It is shown there exist nonzero (resp. sign) patterns 𝒜 and ? of orders 4 and 5 (resp. 4 and 4) such that both 𝒜 and ? are non-inertially-arbitrary, and 𝒜 ⊕ ? is inertially arbitrary.     

Sparse inertially arbitrary patterns

An n-by-n sign pattern is a matrix with entries in {+,-,0}. An n-by-n nonzero pattern is a matrix with entries in {*,0} where * represents a nonzero entry. A pattern is inertially arbitrary if for every set of nonnegative integers n₁,n₂,n₃ with n₁+n₂+n₃=n there is a real matrix with pattern having inertia (n₁,n₂,n₃). We explore how the inertia of a matrix relates to the signs of the coefficients of its characteristic polynomial and describe the inertias allowed by certain sets of polynomials. This information is useful for describing the inertia of a pattern and can help show a pattern is inertially arbitrary. Britz et al. [T. Britz, J.J. McDonald, D.D. Olesky, P. van den Driessche, Minimal spectrally arbitrary sign patterns, SIAM J. Matrix Anal. Appl. 26 (2004) 257–271] conjectured that irreducible spectrally arbitrary patterns must have at least 2n nonzero entries; we demonstrate that irreducible inertially arbitrary patterns can have less than 2n nonzero entries.     

Sign patterns that require real,nonreal or pure imaginary eigenvalues

We characterize the n-by-n sign pattern matrices that require all real, all nonreal, and all pure imaginary eigenvalues. Characterization of sign patterns that allow a real eigenvalue and those that allow a nonreal eigenvalue then follow. Some related specialized results and a characterization of sign patterns that allow a positive real eigenvalue are included.     

± sign pattern matrices that allow orthogonality

A sign pattern A is a ± sign pattern if A has no zero entries. A allows orthogonality if there exists a real orthogonal matrix B whose sign pattern equals A. Some sufficient conditions are given for a sign pattern matrix to allow orthogonality, and a complete characterization is given for ± sign patterns with n − 1 ⩽ N₋(A) ⩽ n + 1 to allow orthogonality.     

Several spectrally arbitrary ray patterns

A ray pattern A of order n is said to be spectrally arbitrary if given any monic nth degree polynomial f(x) with coefficients from ?, there exists a matrix realization of A such that its characteristic polynomial is f(x). An n?×?n ray pattern A is said to be minimally spectrally arbitrary if replacing any nonzero entry of A by zero destroys this property. In this article, several families of ray patterns are presented and proved to be minimally spectrally arbitrary. We also show that for n?≥?5, when A _n is spectrally arbitrary, then it is minimally spectrally arbitrary.     

Potentially nilpotent and spectrally arbitrary even cycle sign patterns

An n × n sign pattern S_n is potentially nilpotent if there is a real matrix having sign pattern S_n and characteristic polynomial xⁿ. A new family of sign patterns C_n with a cycle of every even length is introduced and shown to be potentially nilpotent by explicitly determining the entries of a nilpotent matrix with sign pattern C_n. These nilpotent matrices are used together with a Jacobian argument to show that C_n is spectrally arbitrary, i.e., there is a real matrix having sign pattern C_n and characteristic polynomial for any real μ_i. Some results and a conjecture on minimality of these spectrally arbitrary sign patterns are given.     

Spectrally arbitrary ray patterns

An n×n ray pattern A is said to be spectrally arbitrary if for every monic nth degree polynomial f(x) with coefficients from C, there is a matrix in the pattern class of A such that its characteristic polynomial is f(x). In this article the authors extend the nilpotent-Jacobi method for sign patterns to ray patterns, establishing a means to show that an irreducible ray pattern and all its superpatterns are spectrally arbitrary. They use this method to establish that a particular family of n×n irreducible ray patterns with exactly 3n nonzeros is spectrally arbitrary. They then show that every n×n irreducible, spectrally arbitrary ray pattern has at least 3n-1 nonzeros.     

幂零-中心化方法的一个应用

试图丰富谱任意符号模式矩阵类.给出了一个新的含有2n个非零元的符号模式矩阵,并运用幂零-中心化方法与幂零-雅可比方法分别研究了该模式的所有母模式是谱任意的.进一步证明了该模式是极小谱任意的.最后比较了两种证明方法的联系与区别.     

幂零--中心化方法

An nxn complex sign pattern(ray pattern) S is said to be spectrally arbitrary if for every monic nth degree polynomial f(λ) with coefficients from C,there is a complex matrix in the complex sign pattern class(ray pattern class) of S such that its characteristic polynomial is f(λ).We derive the Nilpotent-Centralizer methods for spectrally arbitrary complex sign patterns and ray patterns,respectively.We find that the Nilpotent-Centralizer methods for three kinds of patterns(sign pattern,complex sign pattern,ray pattern) are the same in form.     

Graphic Sequences with a Realization Containing a Union of Cliques

An integer sequence π is said to be graphic if it is the degree sequence of some simple graph G. In this case we say that G is a realization of π. Given a graph H, and a graphic sequence π we say that π is potentially H-graphic if there is some realization of π that contains H as a subgraph. We define σ(H,n) to be the minimum even integer such that every graphic sequence with sum at least σ(H,n) is potentially H-graphic. In this paper, we determine σ(H,n) for the graph H = K_m1∪ K_m2∪...∪ K_mk when n is a sufficiently large integer. This is accomplished by determining σ(K_j + kK₂,n) where j and k are arbitrary positive integers, and considering the case where j = m − 2k and m = ∑ m_i.     

一类新的极小谱任意符号模式

若给定任意一个$n$次首一实系数多项式$f(\lambda)$,都存在一个实矩阵$B\in Q(A)$, 使得$B$的特征多项式为$f(\lambda)$,则称$A$为谱任意符号模式. 如果一个谱任意符号模式的任意非零元被零取代后所得到的符号模式不是谱任意,那么这个谱任意符号模式称为极小谱任意符号模式.本文证明一类极小谱任意符号模式.     

Inertially arbitrary patterns

An n×n sign pattern matrix A is an inertially arbitrary pattern (IAP) if each non-negative triple (r s t) with r+s+t=n is the inertia of a matrix with sign pattern A. This paper considers the n×n(n2) skew-symmetric sign pattern S_n with each upper off-diagonal entry positive, the (1,1) entry negative, the (n n) entry positive, and every other diagonal entry zero. We prove that S_n is an IAP.     

Succinct data structures for flexible text retrieval systems

We propose succinct data structures for text retrieval systems supporting document listing queries and ranking queries based on the tf*idf (term frequency times inverse document frequency) scores of documents. Traditional data structures for these problems support queries only for some predetermined keywords. Recently Muthukrishnan proposed a data structure for document listing queries for arbitrary patterns at the cost of data structure size. For computing the tf*idf scores there has been no efficient data structures for arbitrary patterns.Our new data structures support these queries using small space. The space is only 2/ times the size of compressed documents plus 10n bits for a document collection of length n, for any 0<1. This is much smaller than the previous O(nlogn) bit data structures. Query time is O(m+qlogn) for listing and computing tf*idf scores for all q documents containing a given pattern of length m. Our data structures are flexible in a sense that they support queries for arbitrary patterns.     

When does the inverse have the same sign pattern as the transpose?

By a sign pattern (matrix) we mean an array whose entries are from the set {+, –, 0}. The sign patterns A for which every real matrix with sign pattern A has the property that its inverse has sign pattern A ^T are characterized. Sign patterns A for which some real matrix with sign pattern A has that property are investigated. Some fundamental results as well as constructions concerning such sign pattern matrices are provided. The relation between these sign patterns and the sign patterns of orthogonal matrices is examined.     

Bounds on the local bases of primitive nonpowerful nearly reducible sign patterns

In this work, we study the kth local base, which is a generalization of the base, of a primitive non-powerful nearly reducible sign pattern of order n ≥ 7. We obtain the sharp bound together with a complete characterization of the equality case, of the kth local bases for primitive non-powerful nearly reducible sign patterns. We also show that there exist “gaps” in the kth local base set of primitive non-powerful nearly reducible sign patterns.     

Symmetric sign patterns with maximal inertias

The inertia of an n by n symmetric sign pattern is called maximal when it is not a proper subset of the inertia of another symmetric sign pattern of order n. In this note we classify all the maximal inertias for symmetric sign patterns of order n, and identify symmetric sign patterns with maximal inertias by using a rank-one perturbation.     

三幂等符号模式矩阵的结构

Abstract. A matrix whose entries are , -, and 0 is called a sign pattern matrix. For a signpattern matrix A,if A3 =A, then A is said to be sign tripotent. In this paper, the characteriza-tion of the n by n(n≥2) sign pattern matrices A which are sign tripotent has been given out.Furthermore, the necessary and sufficient condition of A3=A but A2≠A is obtained, too.     

Sign patterns allowing nilpotence of index 3

Suppose P is a property referring to a real matrix. We say that a sign pattern A allows P if there exists at least one matrix with the same sign pattern as A that has the property P. In this paper, we study sign patterns allowing nilpotence of index 3. Four methods for constructing sign patterns that allow nilpotence of index 3 are obtained. All tree sign patterns that allow nilpotence of index 3 are characterized. Sign patterns of order 3 that allow nilpotence are identified.