The Hurwitz Equivalence Problem is Undecidable
Abstract
In this paper, we prove that the Hurwitz equivalence problem for 1-factorizations in F2 F2 is undecidable, and as a consequence, the Hurwitz equivalence problem for 2-factorizations in the braid groups Bn, n≥ 5 is also undecidable.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.