arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0410444math.AGmath.GT
收藏

Braid Monodromy Computation of Real Singular Curves

S. Kaplan, E. Liberman, M. Teicher

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑