3 research outputs found
Minimum Ranks and Refined Inertias of Sign Pattern Matrices
A sign pattern is a matrix whose entries are from the set . This thesis contains problems about refined inertias and minimum ranks of sign patterns.
The refined inertia of a square real matrix , denoted \ri(B), is the ordered -tuple , where (resp., ) is the number of eigenvalues of with positive (resp., negative) real part, is the number of zero eigenvalues of , and is the number of pure imaginary eigenvalues of . The minimum rank (resp., rational minimum rank) of a sign pattern matrix is the minimum of the ranks of the real (resp., rational) matrices whose entries have signs equal to the corresponding entries of .
First, we identify all minimal critical sets of inertias and refined inertias for full sign patterns of order 3. Then we characterize the star sign patterns of order that require the set of refined inertias , which is an important set for the onset of Hopf bifurcation in dynamical systems. Finally, we establish a direct connection between condensed sign patterns and zero-nonzero patterns with minimum rank and point- hyperplane configurations in . Some results about the rational realizability of the minimum ranks of sign patterns or zero-nonzero patterns are obtained
Density and Chromatic Index, and Minimum Ranks of Sign Pattern Matrices
Given a (multi)graph, the density is defined by The {\bf chromatic index} of a graph is the minimum number of colors that required to color the edges of such that two adjacent edges receive different colors. It is known that . The {\bf cover index} of is the greatest integer for which there is a coloring of with colors such that each vertex of is incident with at least one edge of each color. A sign pattern is a matrix whose entries are from the set .
In part 1, we will generally discuss the connections between the density and the chromatic index. In particular, the Goldberg-Seymour conjecture states that if , where is the maximum degree of . Some open problems are mentioned at the end of part 1. In particular, a dual conjecture to the Goldberg-Seymour conjecture on the cover index is discussed. A proof of the Goldberg-Seymour conjecture is given In part 2.
In part 3, we will present a connection between the minimum ranks of sign pattern matrices and point-line configurations