Braid Monodromy Computation of Real Singular Curves

Simple item page
dc.creatorKaplan, S.
dc.creatorLiberman, E.
dc.creatorTeicher, M.
dc.date2004-10-20
dc.date.accessioned2026-07-07T05:13:27Z
dc.date.available2026-07-07T05:13:27Z
dc.descriptionWe 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.
dc.description46 pages
dc.identifierhttps://arxiv.org/abs/math/0410444
dc.identifierhttp://arxiv.org/abs/math/0410444
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72947
dc.subjectAlgebraic Geometry
dc.subjectGeometric Topology
dc.titleBraid Monodromy Computation of Real Singular Curves
dc.typetext

Files

Collections

arXiv