The determinant formula for the reduced walk matrix of the Dynkin graph DnD_n

From papers

Let DnD_n (n4n\ge 4) be the Dynkin graph, let W(Dn)W(D_n) be its walk matrix, and let W^(Dn)\hat{W}(D_n) be the (n1)×(n1)(n-1)\times(n-1) matrix obtained from W(Dn)W(D_n) by removing the first row and the last column. Determinant conjecture. The determinant satisfies

detW^(Dn)={±2n21if 4n,0if 4n.\det \hat{W}(D_n)= \begin{cases} \pm 2^{\lfloor\frac{n}{2}\rfloor-1} & \text{if }4\nmid n,\\ 0 & \text{if }4\mid n. \end{cases}

The paper presents this formula as a conjecture and proves it, thereby confirming a recent conjecture of Wang, Liu, and Wang concerning the walk matrix of DnD_n.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Wei Wang, Chuanming Wang and Songlin Guo, “On the walk matrix of the Dynkin graph D_n”, arXiv:2202.13279 (2022).

Solutions 0

No solutions have been posted yet.