Braid Monodromy Computation of Real Singular Curves
S. Kaplan, E. Liberman, M. Teicher
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.
Create a lesson
Related papers
Conjecture B for X10 and its genus-two mirror
Alex Junior Gomez Saltachin
A Bubble Compactification of KSBA Moduli Space of Surfaces of General Type
Yunfeng Jiang
Admissible extremal rays and the anticanonical minimal model program
Sung Rak Choi, Sungwook Jang, Dae-Won Lee
Global vector fields and the automorphism group of regular semisimple Hessenberg varieties
Mikiya Masuda, Takashi Sato, Haozhi Zeng
D-equivalence conjecture for hyperkähler varieties of generalized Kummer type
Will Donovan, Chengxi Wang, Nantao Zhang
Min-plus Bruhat decomposition
Dima Grigoriev