ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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

Forking Path Conjecture for conflated expression graphs. For any w∈Snw\in S_n, if pp and qq are complete paths in Γw\Gamma_w with pa=qap_a=q_a and pz=qzp_z=q_z, then

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

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 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.