English

The inverse inertia problem for the complements of partial $k$-trees

Combinatorics 2012-10-29 v1

Abstract

Let F\mathbb{F} be an infinite field with characteristic different from two. For a graph G=(V,E)G=(V,E) with V=1,...,nV={1,...,n}, let S(G;F)S(G;\mathbb{F}) be the set of all symmetric n×nn\times n matrices A=[ai,j]A=[a_{i,j}] over F\mathbb{F} with ai,j0a_{i,j}\not=0, iji\not=j if and only if ijEij\in E. We show that if GG is the complement of a partial kk-tree and mk+2m\geq k+2, then for all nonsingular symmetric m×mm\times m matrices KK over F\mathbb{F}, there exists an m×nm\times n matrix UU such that UTKUS(G;F)U^T K U\in S(G;\mathbb{F}). As a corollary we obtain that, if k+2mnk+2\leq m\leq n and GG is the complement of a partial kk-tree, then for any two nonnegative integers pp and qq with p+q=mp+q=m, there exists a matrix in S(G;R)S(G;\reals) with pp positive and qq negative eigenvalues.

Keywords

Cite

@article{arxiv.1210.7004,
  title  = {The inverse inertia problem for the complements of partial $k$-trees},
  author = {Hein van der Holst},
  journal= {arXiv preprint arXiv:1210.7004},
  year   = {2012}
}

Comments

10 pages