Braid Monodromy Computation of Real Singular Curves
Algebraic Geometry
2007-05-23 v1 Geometric Topology
Abstract
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.
Keywords
Cite
@article{arxiv.math/0410444,
title = {Braid Monodromy Computation of Real Singular Curves},
author = {S. Kaplan and E. Liberman and M. Teicher},
journal= {arXiv preprint arXiv:math/0410444},
year = {2007}
}
Comments
46 pages