Counting components of an integral lamination
classification
🧮 math.GT
keywords
algorithmcomponentscoordinatesdynnikovintegrallaminationabsolutearithmetic
read the original abstract
We present an efficient algorithm for calculating the number of components of an integral lamination on an $n$-punctured disk, given its Dynnikov coordinates. The algorithm requires $O(n^2M)$ arithmetic operations, where $M$ is the sum of the absolute values of the Dynnikov coordinates.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.