1 citations · 2 across the 4 of their papers we have counts for
Showing math.AGShow all
3 papers · 1 filter
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…
math.AG2002★ 1 cited
Identifying Powers of Half-Twists and Computing its Root
T. Ben-Itzhak, S. Kaplan, M. Teicher
In this paper we give an algorithm for solving a main case of the conjugacy problem in the braid groups. We also prove that half-twists satisfy a special root property which allows…
math.AG2001
Identifying Half-Twists Using Randomized Algorithm Methods
S. Kaplan, M. Teicher
Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are…