Three-page indices for rational links and pretzel links
A three-page presentation consists of arcs placed on three distinct pages, each containing non-intersecting arcs. In 1999, Dynnikov showed that every link admits such a presentation. The three-page index [Formula: see text] of a link L is the minimum number of arcs needed to represent L in a three-page presentation. In this paper, we examine the three-page presentations of rational links and pretzel links, and investigate upper bounds for their three-page indices.
Authors
- Hyungkee Yoo (ORCID: https://orcid.org/0000-0002-6083-3165)
Institutions
- Sunchon National University (KR)
Publication Details
- Journal
- Journal of Knot Theory and Its Ramifications
- Published
- 2025-08-30
- DOI
- https://doi.org/10.1142/s0218216525500749
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00