3
$\begingroup$

If $G$ is a labeled graph, the multi-affine characteristic polynomial (which depends on labeling) is defined by

$\Phi_G(x_1,...,x_n)=\det(I_x-A)$, where $I_x$ is the diagonal matrix $diag\{x_1,...,x_n\}$ and $A$ is the adjacency matrix.

Since we can also write $\Phi_G=\det( \sum_{j=1}^n x_jI_j-A)$, where $I_j$ is the matrix which is

$1$ at the $(j,j)$ position and zero elsewhere which are positive semi definite and $A$ is symmetric, $P=\Phi_G$ is real stable.

It follows we must have $\Delta_{ij}(P)=P_iP_j-PP_{ij} \ge 0$ as real valued function.

How does one prove that in the case of a tree $T$, $\Delta_{ij}(\Phi_T)=(\Phi_{T-[v_i,v_j]})^2,$

where $T-[v_i,v_j]$ means the forests given by $T$ with all vertices (include end points) on the unique path from $v_i$ to $v_j$ deleted ?

In case $G$ is not a tree, how to prove $\Phi_G$ is still a perfect square ? How to read off the square root from the graph?

(Added) The fact that $\Delta_{ij}(P)$ is a perfect square holds more generally if we take $A$ to be any Hermitian matrix. In that case $\Phi_A$ is still real stable but $D_{ij}$ may be non real and the matrix identity implies $\Delta_{ij}(\Phi_A)=|D_{ij}|^2$ so that it is either a square or a sum of two squares of real polynomials. The interpretation of $D_{ij}$ as polynomial of deleted path in the case of tree is less obvious and actually holds in any graph for which there is a unique path from $v_i$ to $v_j$. How can one read off $D_{ij}$ from the graph when there is more than one path ?

$\endgroup$
2
  • $\begingroup$ One get a more interesting result if one replace determinant by permanent. If we define $\Psi_G=permanent(I_x-A)$, then for a tree $T$, we have $\Delta_{ij}(\Psi_T)=(-1)^{len([v_i,v_j])} (\Psi_{T-[v_i,v_j]})^2$ where $len([v_i,v_j])$ is the length of the unique path $[v_i,v_j]$. $\endgroup$
    – CHUAKS
    Commented Jun 9, 2021 at 3:55
  • $\begingroup$ For a general graph $G$ and $P=\det(I_x-A_G)$, we still have $\Delta_{ij}(P)=(\sum_{p_{ij} \in [v_i,v_j]} \Phi_{G-p_{ij}}(x))^2$, where $p_{ij}$ range over all simple paths form $v_i$ to $v_j$. Here simple means all vertices along the path are distinct. $\endgroup$
    – CHUAKS
    Commented Mar 5, 2022 at 17:56

1 Answer 1

1
$\begingroup$

Let $B$ denote the $n\times n$ matrix $I_x-A$. Let $[n]=\{1,2,\ldots,n\}$. For $I,J\subset [n]$ with the same number of elements, let $D_{I,J}$ denote the determinant of the matrix resulting from $B$ when deleting the rows indexed by the elements of $I$ and the columns indexed by the elements of $J$.

Assuming $i\neq j$, we clearly have $P=D_{\varnothing,\varnothing}$, $P_i=D_{\{i\},\{i\}}$, $P_j=D_{\{j\},\{j\}}$, and $P_{ij}=D_{\{i,j\},\{i,j\}}$. By the Dodgson condensation identity, $$ D_{\{i\},\{i\}}D_{\{j\},\{j\}}-D_{\{i\},\{j\}}D_{\{j\},\{i\}}= D_{\{i,j\},\{i,j\}}D_{\varnothing,\varnothing}\ . $$ Since $B$ is symmetric $D_{\{i\},\{j\}}=D_{\{j\},\{i\}}$. As a result $$ \Delta_{ij}=(D_{\{i\},\{j\}})^2\ . $$

In the tree case, the relation between $\Phi_{T-[v_i,v_j]}$ and $D_{\{i\},\{j\}}$ can be worked out using Theorem 1 of my article "The Grassmann–Berezin calculus and theorems of the matrix-tree type" in Adv. Appl. Math. 2004. For those without access to the journal, the preprint version is here.

$\endgroup$
10
  • $\begingroup$ I don't quite understand. For $\Phi_{T-[v_i,v_j]}$, one has to delete all vertices on the unique path between $v_i$ and $v_j$ but your $D_{\{i\},\{j\}}$ only delete one row and one column. Also how does your argument use the fact that $T$ is a tree. It is not true if $T$ is not a tree. $\endgroup$
    – Chua KS
    Commented Jun 11, 2020 at 15:56
  • $\begingroup$ did you find a mistake in what I wrote? $\endgroup$ Commented Jun 11, 2020 at 15:58
  • $\begingroup$ Why is $D_{\{i\},\{j\}}=\Phi_{T-[v_i,v_j]}$ ? $\endgroup$
    – Chua KS
    Commented Jun 11, 2020 at 16:04
  • $\begingroup$ I did not address that. I found the square root for general graphs. Where did you get that the square root for trees is $\Phi_{T-[v_i,v_j]}$? In general, on MO you should give some context and references. $\endgroup$ Commented Jun 11, 2020 at 16:07
  • $\begingroup$ I updated my answer so you can find how to relate $D$ and $\Phi$. $\endgroup$ Commented Jun 11, 2020 at 16:33

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .