The 3-edge-cut congruence for Speyer's polynomial
The 3-edge-cut congruence for Speyer's polynomial
Let be a -vertex-connected graph with a -edge cut , so that deleting gives two connected components . Let and be obtained by contracting one side of the cut, replacing it by a -valent vertex.
3-edge-cut conjecture. The Speyer polynomials satisfy
The congruence determines the linear and quadratic terms of from the two contracted graphs. The paper reports confirmation for all tested cuts, while higher coefficients are explicitly shown not to be determined in general.
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.