Braid Monodromy Computation of Real Singular Curves

Details Braid Monodromy Computation of Real Singular Curves Braid Monodromy Computation of Real Singular Curves

2004-10-20

arxiv.org/abs/math/0410444v1

Mathematics

Algebraic Geometry

46 pages

Scientific paper

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 curves, and enables the computation of braid monodromy not only of caspidal curves, but of general algebraic curves, with some non simple singularities. Moreover, it works also when in the fiber the curve admits any number of imaginary points. We also provide two examples of how to use the generalized algorithm.

Affiliated with

Also associated with

No associations

Rating

Braid Monodromy Computation of Real Singular Curves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Braid Monodromy Computation of Real Singular Curves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Braid Monodromy Computation of Real Singular Curves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-537943