On the Forking Path Conjecture
Gonzalo Jim\'enez

TL;DR
This paper proves the Forking Path Conjecture for most elements in S_4, identifies a counterexample, and proposes a refined conjecture for the longest element in any symmetric group.
Contribution
It advances understanding of the Forking Path Conjecture by proving it for all but one element in S_4 and suggesting a refined conjecture for larger symmetric groups.
Findings
Proved the conjecture for all but one element in S_4
Identified a counterexample involving two specific paths
Proposed a refined conjecture for the longest element in S_n
Abstract
We prove the Forking Path Conjecture for all but one element in the symmetric group . Two specific paths in the rex graph of that element give a counterexample for the conjecture. We propose a refined conjecture for the longest element of any .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Coding theory and cryptography
