The chordality characterization conjecture for homaloidal spanning tree polynomials

From papers

Let GG be an undirected graph, and let PGP_G denote the spanning tree generating function corresponding to GG. A polynomial is homaloidal if its polar map is birational. Chordality conjecture. The polynomial PGP_G is homaloidal if and only if GG is chordal. The paper proves homaloidality when GG is chordal and non-homaloidality for cycles CnC_n with n4n\geq 4; the converse direction for general non-chordal graphs remains open.

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

Shelby Cox, Pratik Misra and Pardis Semnani, “Homaloidal Polynomials and Gaussian Models of Maximum Likelihood Degree One”, arXiv:2402.06090 (2024).

Solutions 0

No solutions have been posted yet.