The Forking Path Conjecture for reduced expression graphs
Statement
Let be the symmetric group, let , and let be its reduced expression graph. A complete path is a path passing through every vertex of the graph at least once; write and for the starting and ending vertices of a path , and let denote its induced morphism.
Forking Path Conjecture. For any , if and are complete paths in with and , then
The conjecture asserts that the induced morphism depends only on the common endpoints of complete paths. The paper states that it is false for some elements of , while proving it for all but one element there; the general conjecture is therefore 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.