Affiliation:
1. University of Central Oklahoma
2. Oklahoma State University
Abstract
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
))…(
y
−
y
n
(
x
))=0, where
n
∈ Z
+
and
y
i
∈ C[
x
]. Also, an algorithm is presented to compute the Alexander polynomial of these curve complements using Burau representations of braid groups. Examples for each computation are provided.
Publisher
Association for Computing Machinery (ACM)
Subject
Applied Mathematics,Software
Reference33 articles.
1. Jaume Amorós and I. Berna Sepúlveda. 2012. Monodromías geométricas en familias de curvas de género. PhD Thesis Universitat Politècnica de Cat Jaume Amorós and I. Berna Sepúlveda. 2012. Monodromías geométricas en familias de curvas de género. PhD Thesis Universitat Politècnica de Cat
2. Fundamental groups of tangent conic-line arrangements with singularities up to order 6
3. Braid monodromy and topology of plane curves
4. Effective invariants of braid monodromy
5. Topology and combinatorics of real line arrangements