The 3-edge-cut congruence for Speyer's polynomial
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.