The 3-sum formula for Speyer's invariant
The 3-sum formula for Speyer's invariant
Let and be two -connected graphs, each with a triangle , and let be a corresponding 3-sum. Define
to be the number of connected components remaining after deleting the triangle vertices.
3-sum conjecture. The invariant satisfies
The formula would reduce computations of to highly connected graphs and includes a star--triangle relation as a special case. The paper reports computational confirmation but no proof.
Sources & referencesView supporting material
Primary source
Erik Panzer, “Graph theoretic properties of Speyer's matroid polynomial g_M(t)”, arXiv:2506.18788 (2025).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.