Computing the Braid Monodromy of Completely Reducible <i>n</i> -gonal Curves
Computing the Braid Monodromy of Completely Reducible <i>n</i> -gonal Curves
Braid monodromy is an important tool for computing invariants of curves and surfaces. In this paper, the rectangular braid diagram (RBD) method is proposed to compute the braid monodromy of a completely reducible n -gonal curve, i.e., the curves in the form ( y − y 1 ( x ))…( …