Papers
Topics
Authors
Recent
Search
2000 character limit reached

Three-page indices of torus links

Published 18 Jul 2025 in math.GT | (2507.13633v1)

Abstract: An arc presentation of a link is an embedding into the open book decomposition of $\mathbb{R}3$ with a finite number of pages. An important rule of arc presentations is that different arcs must be placed on separate pages. In 1999, Dynnikov proposed a three-page presentation that bends this rule by restricting the total number of pages to three. Dynnikov showed that every link admits a three-page presentation. In this paper, we provide an alternative proof of this result. Also we define the three-page index $\alpha_3(L)$ of a link $L$ that the minimum number of arcs needed to represent $L$ in a three-page presentation. We examine three-page presentations for torus links, leading to the determination of the exact three-page indices for several torus links.

Authors (3)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.