activity
20012006
most citedProbabilistic Solutions of Equations in the Braid Group

57 citations · 68 across the 10 of their papers we have counts for

collaborators

10 papers

math.AG2006★ 1 cited

Several Applications of Bezout Matrices

A. Shapiro, S. Kaplan, M. Teicher

The notion of Bezout matrix is an essential tool in studying broad variety of subjects: zeroes of polynomials, stability of differential equations, rational transformations of alge…

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.GT2004

Palindromic Braids

F. Deloup, D. Garber, S. Kaplan +1

The braid group , endowed with Artin's presentation, admits an antiautomorphism , such that is defined by reading braids in reverse orde…

math.GR2004★ 57 cited

Probabilistic Solutions of Equations in the Braid Group

D. Garber, S. Kaplan, M. Teicher +2

Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a sol…

math.GR2003

Conjugacy in Artin groups and applications to the classification of surfaces

Eddy Godelle, Mina Teicher, Shmuel Kaplan

We show thatthe double reversing algorithm proposed by dehornoy for solving the word problem in the braid group can also be used to recognize the conjugates of powers of the genera…

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…