ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let SnS_n be the symmetric group, let w∈Snw\in S_n, and let Rex(w)Rex(w) be its reduced expression graph. A complete path is a path passing through every vertex of the graph at least once; write pap_a and pzp_z for the starting and ending vertices of a path pp, and let f(p)f(p) denote its induced morphism.

Forking Path Conjecture. For any w∈Snw\in S_n, if pp and qq are complete paths in Rex(w)Rex(w) with pa=qap_a=q_a and pz=qzp_z=q_z, then

f(p)=f(q).f(p)=f(q).

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 S4S_4, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.