Braid monodromy computation of real singular curves

DOI10.4310/MAA.2018.V25.N4.A7MaRDI QIDQ2010779zbMATH OpenWikidataFDO

Authors Eran Liberman, Mina Teicher, Shmuel Kaplan

Publication date 28 November 2019

Published in Methods and Applications of Analysis (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0410444

zbMATH Keywords

singularitiesbraid monodromy

Mathematics Subject Classification ID

Singularities of curves, local rings (14H20) Real algebraic sets (14P05) Braid groups; Artin groups (20F36) Coverings of curves, fundamental group (14H30) Computational aspects of algebraic curves (14Q05)

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.

Recommendations

• BRAID MONODROMY OF SPECIAL CURVES
• Computing the braid monodromy of completely reducible \(n\)-gonal curves
• Bifurcation braid monodromy of plane curves
• Effective invariants of braid monodromy
• Braid monodromy of algebraic curves

Cited in

(7)

• Computing the braid monodromy of completely reducible \(n\)-gonal curves
• Efficient computation of the branching structure of an algebraic curve
• Kummer covers and braid monodromy
• Realizability of a braid monodromy by an algebraic function in a disk
• Braid monodromy and Alexander polynomials of real plane curves
• BRAID MONODROMY OF SPECIAL CURVES
• On braid monodromy factorizations

This page was built for publication: Braid monodromy computation of real singular curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010779)