AI 中文总结
该研究针对复直线排列的辫单值群计算问题，提出LA-MOKA算法，通过将连续几何转化为离散组合结构并建立拓扑正确性条件，解决数域上的浮点近似问题。
AI 中文摘要
计算辫单值群是研究复射影平面$\boldsymbol{\text{P}}^2$中代数曲线拓扑的关键工具。我们提出一种名为LA-MOKA的算法，用于在复直线排列的特定情形下计算该不变量。为安全处理数域上工作时的浮点近似问题，我们将连续几何转化为离散组合结构，并为该离散化建立明确条件，以保证所计算辫单值群的拓扑正确性。
英文摘要
Computing braid monodromy is a key tool for studying the topology of algebraic curves in the complex projective plane $\mathbb{P}^2$. We present an algorithm, named LA-MOKA, to compute this invariant in the specific case of complex line arrangements. To safely manage the problem of floating-point approximations when working over number fields, we translate the continuous geometry into a discrete combinatorial structure. We establish explicit conditions on this discretization that guarantee the topological correctness of the computed braid monodromy.
Comments13 pages, 3 Figures and 1 Tables
