Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 175 tok/s Pro
GPT OSS 120B 454 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

The inverse inertia problem for the complements of partial $k$-trees (1210.7004v1)

Published 25 Oct 2012 in math.CO

Abstract: Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with $a_{i,j}\not=0$, $i\not=j$ if and only if $ij\in E$. We show that if $G$ is the complement of a partial $k$-tree and $m\geq k+2$, then for all nonsingular symmetric $m\times m$ matrices $K$ over $\mathbb{F}$, there exists an $m\times n$ matrix $U$ such that $UT K U\in S(G;\mathbb{F})$. As a corollary we obtain that, if $k+2\leq m\leq n$ and $G$ is the complement of a partial $k$-tree, then for any two nonnegative integers $p$ and $q$ with $p+q=m$, there exists a matrix in $S(G;\reals)$ with $p$ positive and $q$ negative eigenvalues.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.