Search

Using the method of seeds and branch duplication, it is shown that for every tree of diameter, there is an Hermitian matrix with as few asdistinct eigenvalues (a known lower bound). For diameter 7, some trees require 8 distinct eigenvalues, but no more; the seeds for which 7 and 8 are the worst case are classified. For trees of diameter, it is shown that, in general, the minimum number of distinct eigenvalues is bounded by a function of. Many trees of high diameter permit as few of distinct eigenvalues as the diameter and a conjecture is made that all linear trees are of this type. Several other specific, related observations are made. [ABSTRACT FROM PUBLISHER]

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]