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 -punctured disk, taking as input their Dynnikov coordinates. The algorithm has complexity , where 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.
Recommendations
Cites work
- Geometric intersection of curves on punctured disks
- On a Yang-Baxter map and the Dehornoy ordering
- On computing the entropy of braids
- On the minimal positive standardizer of a parabolic subgroup of an Artin-Tits group
- On the topological entropy of families of braids
- Ordering braids.
- The \(P(\phi )_{2}\) Euclidean (quantum) field theory.
- Theory of braids
Cited in
(5)
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)