Braid Monodromy Computation of Real Singular Curves

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
46 pages

Keywords

Algebraic Geometry, Geometric Topology

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/72947

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0410444
 http://arxiv.org/abs/math/0410444

Collections

arXiv