The size of spanning disks for polygonal curves (Q1864124): Difference between revisions

Several algorithms devised in topology (to test knot triviality) or group theory (for the word problem) are based on a search for embedded piecewise-linear spanning disks. The main result of the paper under review shows that the disks can be exponentially more complicated than the boundary curves: For any positive integer \(n\), there exists an unknotted polygon \(K_n\) in \(\mathbb R ^3\) with at most \(10n+9\) edges such that any piecewise-smooth embedded disk spanning \(K_n\) intersects the y-axis in at least \(2^{n-1}\) points and any embedded piecewise-linear triangulated disk bounded by \(K_n\) contains at least \(2^{n-1}\) triangles. In order to use results from smooth Morse theory and classification of diffeomorphisms of surfaces, the proof includes arguments for approximating piecewise-linear maps by smooth maps.