2020
DOI: 10.4310/cag.2020.v28.n2.a2
|View full text |Cite
|
Sign up to set email alerts
|

Wirtinger systems of generators of knot groups

Abstract: We define the Wirtinger number of a link, an invariant closely related to the meridional rank. The Wirtinger number is the minimum number of generators of the fundamental group of the link complement over all meridional presentations in which every relation is an iterated Wirtinger relation arising in a diagram. We prove that the Wirtinger number of a link equals its bridge number. This equality can be viewed as establishing a weak version of Cappell and Shaneson's Meridional Rank Conjecture, and suggests a ne… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
24
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(28 citation statements)
references
References 14 publications
0
24
0
Order By: Relevance
“…FIGURE 2. In a k-partially colored diagram D, if there is a crossing where locally, the incoming strand is assigned the color blue and the overstrand is assigned the color blue, a coloring move can be performed to extend the coloring to the outgoing strand so that we have a (k + 1)partial coloring of D. [5]. The idea is to define the minimal number of arcs of a diagram needed to complete the Wirtinger algorithm to present π 1 (S 3 \ N(K).…”
Section: Preliminariesmentioning
confidence: 99%
See 3 more Smart Citations
“…FIGURE 2. In a k-partially colored diagram D, if there is a crossing where locally, the incoming strand is assigned the color blue and the overstrand is assigned the color blue, a coloring move can be performed to extend the coloring to the outgoing strand so that we have a (k + 1)partial coloring of D. [5]. The idea is to define the minimal number of arcs of a diagram needed to complete the Wirtinger algorithm to present π 1 (S 3 \ N(K).…”
Section: Preliminariesmentioning
confidence: 99%
“…The bridge number provides a comprehensible exhaustion of all knots; indeed, 2-bridge knots are the simplest of knots in many ways, and their classification by Schubert was a triumph of early knot theory [37]. For suitable classes of knots, the bridge number can be used to estimate other geometric invariants such as hyperbolic volume [5,Theorem 1.5], distortion [6,Theorem 1.1], ropelength [12,Theorem 5], and total curvature [29,Corollary 3.2]. Cappell and Shaneson's Meridional Rank Conjecture posits that β (K) is equal to the meridional rank µ(K), the minimal number of meridians needed to generate π 1 (S 3 \K).…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations
“…We have slightly simplified the original definition of k-colorability, which makes use of k different colors. Multiple colors are needed in the proof of the Main Theorem of[4], but they are of no help to us here. The modified definition has no effect on the value of ω(D).…”
mentioning
confidence: 99%