Intersections of multicurves from Dynnikov coordinates

From MaRDI portal



Abstract: We present an algorithm for calculating the geometric intersection number of two multicurves on the n-punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity O(m2n4), where m is the sum of the absolute values of the Dynnikov coordinates of the two multicurves. The main ingredient is an algorithm due to Cumplido for relaxing a multicurve.












This page was built for publication: Intersections of multicurves from Dynnikov coordinates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4576829)