MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I've got a symmetric matrix $A$ whose entries are in $\{0,-1,1\}$, with the diagonal entries all equal to $1$. I'm interested in finding a combinatorial description of the entries of the inverse of $A$ (when it exists).

Now the snag is that this looks tantalizingly close to a matrix-tree type problem but not quite, because in a matrix-tree type problem each diagonal entry is equal to the negative of the sum of the off-diagonal entries in its row. I could not find a good way to reduce my problem to this case because nothing prevents the off-diagonal sum from being zero in my case, so scaling seems to be out of the question and additive changes would probably destroy any structure.

Is there some other way to relate my problem to matrix-tree?

share|cite|improve this question
Have you seen the paper "Self-Avoiding Paths and the Adjacency Matrix of a Graph" by Ponstein? ( He gives a nice combinatorial way of looking at $(\lambda I-A)^{-1}$ where $A$ is an adjacency matrix and $\lambda$ is some constant. – Skoro Jul 8 '13 at 3:54
@Skoro Thanks, this looks very interesting! – Felix Goldberg Jul 8 '13 at 10:16

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.