The Forking Path Conjecture for conflated expression graphs
Statement
Let be the symmetric group. For , let be its conflated expression graph, and let denote the morphism induced by a path in . A complete path is a path passing through every vertex of the graph at least once; write and for its starting and ending vertices.
Forking Path Conjecture for conflated expression graphs. For any , if and are complete paths in with and , then
This is presented as an equivalent formulation of the Forking Path Conjecture, not as a new independent claim. Since the original conjecture has counterexamples, this equivalent formulation is also refuted.
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.