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(n^{2}M)$ arithmetic operations, where $M$ is the sum of the absolute values of the Dynnikov coordinates.

17 pages, 2 Figures