2005
DOI: 10.1017/s0305004105008741
|View full text |Cite
|
Sign up to set email alerts
|

On the Thurston–Bennequin invariant of graph divide links

Abstract: We determine the Thurston-Bennequin invariant of graph divide links, which include all closed positive braids, all divide links and certain negative twist knots. As a corollary of this and a result of P. Lisca and A. I. Stipsicz, we prove that the 3-manifold obtained from S 3 by Dehn surgery along a non-trivial graph divide knot K with coefficient r carries positive, tight contact structures for every r except the Thurston-Bennequin invariant of K.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…Tomomi Kawamura taught the author that this fact had been proved by Mikami Hirasawa (see also [25, Remark 6.9]). Ishikawa [23] proved that the maximal Thurston-Bennequin number of any graph divide link is equal to its slice Euler characteristic. This means graph divide links satisfy a necessary condition to be Lagrangian fillable.…”
Section: Further Discussionmentioning
confidence: 99%
“…Tomomi Kawamura taught the author that this fact had been proved by Mikami Hirasawa (see also [25, Remark 6.9]). Ishikawa [23] proved that the maximal Thurston-Bennequin number of any graph divide link is equal to its slice Euler characteristic. This means graph divide links satisfy a necessary condition to be Lagrangian fillable.…”
Section: Further Discussionmentioning
confidence: 99%
“…Thus in each of these cases the result follows from Proposition 3.2. The remaining "sporadic" knots, families IX-XII, have tb = 2g − 1 because they are all divide knots [79], hence they satisfy tb(K) = 2g s (K) − 1 [42], and as L-space knots they have g s (K) = g(K) [64], and the result follows.…”
Section: 2mentioning
confidence: 99%