2014
DOI: 10.1016/j.aim.2014.01.018
|View full text |Cite
|
Sign up to set email alerts
|

Donaldson's theorem, Heegaard Floer homology, and knots with unknotting number one

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 15 publications
(29 citation statements)
references
References 24 publications
0
29
0
Order By: Relevance
“…Since the boundary Σ(K) is a rational homology 3-sphere, Q K ⊕ R n embeds into the intersection form Q X of X, as can be seen from the Mayer-Vietoris sequence (see [8]). As W K is simply connected (by Theorem 3.2), if X K is simply connected then so too is X.…”
Section: The Case P + Q = −2mentioning
confidence: 99%
See 3 more Smart Citations
“…Since the boundary Σ(K) is a rational homology 3-sphere, Q K ⊕ R n embeds into the intersection form Q X of X, as can be seen from the Mayer-Vietoris sequence (see [8]). As W K is simply connected (by Theorem 3.2), if X K is simply connected then so too is X.…”
Section: The Case P + Q = −2mentioning
confidence: 99%
“…Unfortunately, however, for this choice of X there always exists an A satisfying (3.1). To get around this problem, we mimic the work of Greene [8], in which Heegaard Floer homology is used to impose a certain structure on A. In order to explain this, we review some Heegaard Floer homology.…”
Section: Plumbingsmentioning
confidence: 99%
See 2 more Smart Citations
“…This is the obvious generalisation to links of the unknotting number, and one should expect that many of the same methods should apply to compute it for examples. There have been several successful applications of Donaldson's diagonalisation theorem and Heegaard Floer homology to the calculation of unknotting numbers, for example [6,26,21,11,19]. It is an interesting problem, which we begin to address here, to generalise these techniques to the case of links.…”
Section: Introductionmentioning
confidence: 99%