Counting components of an integral lamination
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(n2M) arithmetic operations, where M is the sum of the absolute values of the Dynnikov coordinates.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.