The twist invariance conjecture for Speyer's invariant
Statement
Let and be -connected graphs related by a twist along a minimal -vertex cut; minimality means that no proper subset of the four vertices already separates the graph.
Twist invariance conjecture. Then
Together with the proposed 3-sum formula, this would provide structural reductions for computing . The paper reports extensive computational evidence, but leaves the identity open.
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.