Construction of acyclic matrices from spectral data

From MaRDI portal





Given a tree \(\Gamma\) with \(n\) vertices, an integer \(1\leq i\leq n\) and \(2n-1\) real numbers \(\lambda_1\geq \mu_1\geq \lambda_2\geq \mu_2\geq\cdots\geq \mu_{n-1}\geq \lambda_n\), the author shows that there is an \(n\times n\) Hermitian matrix \(A\) with the following properties: (i) \(a_{ij}=a_{ji}=0\) if \(i\neq j\) and \(\{i,j\}\) is not an edge of \(\Gamma\), (ii) \(A\) has eigenvalues \(\lambda_1,\lambda_2, \ldots,\lambda_n\), and (iii) \(A(i)\) obtained from \(A\) by deleting row \(i\) and column \(i\) has eigenvalues \(\mu_1,\mu_2, \ldots,\mu_{n-1}\). The result is a generalization of a number of earlier theorems stated by different authors: \textit{G. E. Shilov} [An introduction to the theory of linear spaces. (Russian) Moscow: Nauka (1952; Zbl 0046.24101)], \textit{Ky Fan} and \textit{G. Pall} [Can. J. Math. 9, 298--304 (1957; Zbl 0077.24504)], \textit{O. H. Hald} [Linear Algebra Appl. 14, 63--85 (1976; Zbl 0328.15007)], etc.




Cited in
(34)








This page was built for publication: Construction of acyclic matrices from spectral data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112923)