1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.LO2005
The Hurwitz Equivalence Problem is Undecidable
E. Liberman, M. Teicher
In this paper, we prove that the Hurwitz equivalence problem for 1-factorizations in is undecidable, and as a consequence, the Hurwitz equivalence problem for $Δ^2…
math.AG2004★ 1 cited
Braid Monodromy Computation of Real Singular Curves
S. Kaplan, E. Liberman, M. Teicher
We generalize the Moishezon Teicher algorithm that was suggested for the computation of the braid monodromy of an almost real curve. The new algorithm suits a larger family of curv…