Related papers: Braid Monodromy Computation of Real Singular Curve…
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
In this article, we compute the braid monodromy of two algebraic curves defined over R. These two curves are of complex level not bigger than 6, and they are unions of lines and conics. We use two different techniques for computing their…
Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the \emph{rectangular braid diagram (RBD)} method is proposed to compute the braid monodromy of a completely reducible $n$-gonal curve,…
In this paper, we give a fully detailed exposition of computing fundamental groups of complements of line arrangements using the Moishezon-Teicher technique for computing the braid monodromy of a curve and the Van-Kampen theorem which…
We describe symmetries of the braid monodromy decomposition for a class of plane curves defined over reals including the real curves with no real points and proving new divisibility relations for Alexander invariants of such curves.
We consider spaces of plane curves in the setting of algebraic geometry and of singularity theory. On one hand there are the complete linear systems, on the other we consider unfolding spaces of bivariate polynomials of Brieskorn-Pham type.…
Tropical varieties capture combinatorial information about how coordinates of points in a classical variety approach zero or infinity. We present algorithms for computing the rays of a complex and real tropical curve defined by polynomials…
This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…
We introduce braid monodromy for the discriminant hypersurface in versal unfoldings of hypersurface singularities. Our objective is then to compute this invariant for singularities of Brieskorn Pham type: First we consider the unfolding by…
In this work we describe a method to reconstruct the braid monodromy of the preimage of a curve by a Kummer cover. This method is interesting, since it combines two techniques, namely, the reconstruction of a highly non-generic braid…
To a plane algebraic curve of degree n, Moishezon associated a braid monodromy homomorphism from a finitely generated free group to Artin's braid group B_n. Using Hansen's polynomial covering space theory, we give a new interpretation of…
A well-known and difficult problem in computational number theory and algebraic geometry is to write down equations for branched covers of algebraic curves with specified monodromy type. In this article, we present a technique for computing…
Computation of the fundamental group of the complement in the complex plane of the branch curve S , of a generic projection of the Veronese surface to the plane is presented. This paper is a continuation of our previous papers: Braid Group…
In this paper we construct effective invariants for braid monodromy of affine curves. We also prove that, for some curves, braid monodromy determines their topology. We apply this result to find a pair of curves with conjugate equations in…
We study the theoretical and practical aspects of computing braids described by approximate descriptions of paths in the plane. Exact algorithms rely on the lexicographic ordering of the points in the plane, which is unstable under…
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
We present a certified algorithm based on subdivision for computing an isotopic approximation to any number of curves in the plane. Our algorithm is based on the certified curve approximation algorithm of Plantinga and Vegter. The main…
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 us to reduce the solution for the conjugacy problem in…
We introduce and develop a language of semigroups over the braid groups for a study of braid monodromy factorizations (bmf's) of plane algebraic curves and other related objects. As an application we give a new proof of Orevkov's theorem on…