Invariance of sign stability under mutation-loop representations
Statement
Let be edge paths in the exchange graph representing the same mutation loop . A path is sign-stable when it has the sign-stability property defined for mutation paths. Invariance conjecture. The path is sign-stable if and only if is. This would show that sign stability is an invariant of the mutation loop rather than of its chosen representation sequence; the paper reports that many experiments support the claim, but no proof or counterexample is known.
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.