The Hurwitz Equivalence Problem is Undecidable
E. Liberman, M. Teicher
math.LOarXiv:math/0511153
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.
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf