Transverse braids and combinatorial knot Floer homology
Peter Lambert-Cole, David Shea Vela-Vick

TL;DR
This paper introduces a new combinatorial method to compute the transverse invariant in knot Floer homology, improving previous approaches by explicitly identifying the invariant for transverse links in braid diagrams.
Contribution
The authors develop a novel combinatorial complex that computes knot Floer homology and explicitly identifies the transverse invariant within this framework.
Findings
Successfully computes the transverse invariant for transverse links
Provides a new combinatorial tool for knot Floer homology
Enhances understanding of braid diagrams in knot theory
Abstract
We describe a new method for combinatorially computing the transverse invariant in knot Floer homology. Previous work of the authors and Stone used braid diagrams to combinatorially compute knot Floer homology of braid closures. However, that approach was unable to explicitly identify the invariant of transverse links that naturally appears in braid diagrams. In this paper, we improve the previous approach in order to compute the transverse invariant. We define a new combinatorial complex that computes knot Floer homology and identify the BRAID invariant of transverse knots and links in the homology of this complex.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Homotopy and Cohomology in Algebraic Topology · Botulinum Toxin and Related Neurological Disorders
Transverse braids and combinatorial knot Floer homology
Peter Lambert-Cole
Department of Mathematics
Indiana University
[email protected] https://www.pages.iu.edu/~pblamber and
David Shea Vela-Vick
Department of Mathematics
Louisiana State University
[email protected] https://www.math.lsu.edu/~shea
Abstract.
We describe a new method for combinatorially computing the transverse invariant in knot Floer homology. Previous work of the authors and Stone used braid diagrams to combinatorially compute knot Floer homology of braid closures. However, that approach was unable to explicitly identify the invariant of transverse links that naturally appears in braid diagrams. In this paper, we improve the previous approach in order to compute the transverse invariant. We define a new combinatorial complex that computes knot Floer homology and identify the BRAID invariant of transverse knots and links in the homology of this complex.
Key words and phrases:
Heegaard Floer homology, contact structures, transverse knots
2010 Mathematics Subject Classification:
57M27; 57R58, 57R17
1. Introduction
Every link transverse to the standard contact structure on is the closure of braid that is unique up to conjugation and positive stabilization [Ben83, Wri02]. For any braid , there is a natural multi-pointed Heegaard diagram associated to the corresponding braid closure. This braid diagram is a classic Heegaard decomposition of the link complement, modified to encode the braiding. The diagram determines a bigraded complex whose homology is the knot Floer homology of the mirror of the braid closure. In addition, the diagram determines a closed generator whose homology class in is an invariant of the transverse link determined by . This class is the BRAID invariant of the transverse link , introduced by Baldwin, Vértesi, and the second author [BVV13].
BRAID is equivalent to two other powerful transverse link invariants arising in knot Floer homology, GRID and LOSS [BVV13]. Ozsváth, Szabó, and Thurston introduced the GRID invariant, which takes values in the grid version of knot Floer homology [OST08] and is easily computed for knots with small grid number. Lisca, Ozsváth, Stipsicz, and Szabó then used open book decompositions to define an invariant, commonly referred to as LOSS, of (null-homologous) Legendrian and transverse knots in arbitrary 3–manifolds [LOSS09]. These invariants have been successfully applied to distinguish and classify transverse representatives of various knot types.
The BRAID invariant possesses advantages over its predecessors. Most notably, it is a manifestly transverse invariant as it is defined in terms of transverse knots and links that are braided about open books. When the grid size, or equivalently arc index, exceeds the high teens, GRID cannot be efficiently computed. As the braid complexity of a transverse link is relatively independent of arc index, BRAID potentially expands our ability to effectively distinguish transverse knots.
Together with Stone [LSV13], the authors used this construction to give a new, combinatorial method for computing knot Floer homology for knots and links in . By a sequence of stabilizations and isotopies, the diagram is modified to . This diagram is nice in the sense of Sarkar and Wang [SW10] and thus the differential on the complex can be computed explicitly. Pseudo-holomorphic curve techniques give a chain homotopy equivalence . Thus, the bigraded ranks of of the braid closure can be computed combinatorially. However, the chain map itself, and in particular the image of the BRAID invariant, could not be computed explicitly.
In this paper, we describe an algebraic method to compute BRAID and prove the following theorem.
Theorem 1.1**.**
Let be a braid with transverse link closure . There is an associated complex that is combinatorially computable and an isomorphism on homology
[TABLE]
This complex supports a canonical generator such that
[TABLE]
Specifically, we show how to identify the transverse invariant from the complex without computing the chain map . Starting with the pair of multi-pointed Heegaard diagrams and , we define a new chain complex . This new chain complex is homotopy equivalent to and possesses the same underlying module as . The differential is defined analogously to that of by assigning counts to Whitney disks via the rule
[TABLE]
However, the count of representatives of a domain is determined combinatorially by the differential on , instead of geometrically by counting pseudo-holomorphic representatives. The differential on determines a chain-homotopy equivalence as well. The resulting composition can similarly be interpreted as a standard triangle map defined by assigning modified counts to Whitney triangles. Importantly, while we cannot identify the image of under itself, in Proposition 3.6 we are able to determine its image under the composition , showing
[TABLE]
As a consequence, the transverse invariant is combinatorially computable directly from the braid.
Acknowledgements
We would like to acknowledge the National Science Foundation and Louisiana State University for sponsoring the 2012 LSU Research Experience for Undergraduates (NSF Grant DMS-1156663). The mathematics presented here originated as an offshoot of this program. Vela-Vick would also like to acknowledge partial support from NSF Grant DMS-1249708.
2. Preliminaries
In what follows, we assume familiarity with knot and braid theory, as well as elementary aspects of contact geometry and Legendrian and transverse links. The interested reader is encouraged to consult Birman’s book [Bir74] and Etnyre’s notes [Etn05] for comprehensive introductions to braid theory and to Legendrian and transverse knot theory.
2.1. Knot Floer homology
We begin by summarizing some basic definitions and results concerning knot Floer homology. We refer the reader to the papers by Ozsváth and Szabó [OS04b] and Rasmusen [Ras03] for a more in-depth discussion of this material. Throughout this manuscript, we work with –coefficients.
Recall that to each oriented link in the 3–sphere, one can associate a multi-pointed Heegaard diagram \mathcal{H}=(\Sigma,\mbox{\boldmath\alpha},\mbox{\boldmath\beta},\mathbf{z},\mathbf{w}). In this case, the triple (\Sigma,\mbox{\boldmath\alpha},\mbox{\boldmath\beta}) specifies a Heegaard diagram for and the link is obtained from the basepoints and by connecting the to -basepoints and to -basepoints by properly embedded arcs in the and -handlebodies respectively which avoids the compression disks specified by the curves in and . More generally, a multi-pointed Heegaard triple \mathcal{H}=(\Sigma,\mbox{\boldmath\alpha},\mbox{\boldmath\beta},\mbox{\boldmath\gamma},\mathbf{z},\mathbf{w}) is a collection of three sets of curves \mbox{\boldmath\alpha},\mbox{\boldmath\beta},\mbox{\boldmath\gamma} such that each pair (\mbox{\boldmath\alpha},\mbox{\boldmath\beta}),(\mbox{\boldmath\alpha},\mbox{\boldmath\gamma}), and (\mbox{\boldmath\beta},\mbox{\boldmath\gamma}) determines multi-pointed Heegaard diagrams.
The collections and specify tori and in . The complex is the -vector space freely generated by the intersections in . For each Whitney disk , we let and denote the local multiplicity of at and respectively. We denote by and the sums of the local multiplicities at all of the and -basepoints respectively. The chain group can be endowed with two absolute gradings, the Maslov (homological) grading and Alexander grading , which are determined up to an overall shift by the formulas
[TABLE]
where and denote the Maslov index of the Whitney disk . The differential on the complex is defined by
[TABLE]
The tilde version of knot Floer homology is then
[TABLE]
and is an invariant of the link and the number of or -basepoints. Its relation to the hat version of knot Floer homology is given by
[TABLE]
where is a 2–dimensional vector space supported in bi-gradings and .
Let denote the group of periodic domains in the Heegaard diagram \mathcal{H}=(\Sigma,\mbox{\boldmath\alpha},\mbox{\boldmath\beta},\mathbf{z},\mathbf{w}). Recall that a 2-chain is periodic if its boundary is the union of some number of and curves. Let denote the subgroup of periodic domains that avoid . As a group, is isomorphic to . The Heegaard diagram is admissible if every domain in has both positive and negative multiplicities. The groups of periodic domains and admissibility are defined similarly for a triple .
Finally, given an admissible Heegaard triple \mathcal{H}=(\Sigma,\mbox{\boldmath\alpha},\mbox{\boldmath\beta},\mbox{\boldmath\gamma},\mathbf{z},\mathbf{w}), there is an induced chain map defined as
[TABLE]
2.2. Combinatorial computations
In [LSV13], Stone and the authors described an algorithm for combinatorially computing knot Floer homology. The algorithm begins with a braid presentation of a given link and produces an explicit, nice multi-pointed Heegaard diagram in the sense of Sarkar and Wang [SW10]. We outline below the construction from [LSV13].
A multi-pointed Heegaard diagram is nice if every region in \Sigma\backslash(\mbox{\boldmath\alpha}\cup\mbox{\boldmath\beta}) which does not containing a basepoint is topologically a disk with at most four corners. In other words, every region in the complement of the and -curves either contains a -basepoint, or is a bigon or square. If a multi-pointed Heegaard diagram is nice, the differential on can be computed combinatorially by counting embedded, empty rectangles and bigons connecting generators [SW10].
There is a well-known isomorphism between the -stranded braid group and the mapping class group of the disk with marked points. Let denote the unit disk in with evenly spaced marked points along the horizontal axis. The isomorphism identifies the standard generator of the Artin braid group with the positive half-twist about the horizontal arc joining the and marked points on .
Let denote an arc-basis for consisting of vertical arcs, such that each component of contains exactly one of the -basepoints. Next, let denote a second arc-basis which is obtained from by applying small isotopies which shift the endpoints of the along the orientation of and results in a single transverse intersection .
Take a second copy of the disk with identical basepoints . For a homeomorphism , we endow with two arc bases: the first is identical to , while the second is obtained from by setting . By perturbing, if necessary, we can assume that the and meet transversally in a single point. We then obtain an admissible, multi-pointed Heegaard diagram \mathcal{H}_{\rho}=(\Sigma,\mbox{\boldmath\beta}_{\rho},\mbox{\boldmath\alpha}_{\rho},\mathbf{z},\mathbf{w}) by setting , and .
Note that in the definition of , we have interchanged the roles of the and -curves. Topologically, this has the effect of reversing the orientation of the ambient manifold — in this case, the orientation of . On the level of knot Floer homology groups, we have
[TABLE]
We call a homeomorphism efficient if it minimizes intersections amongst the and within its mapping class. Such maps give rise to multi-pointed Heegaard diagrams which we also call efficient, and which are very close to being nice: they contain at most bad regions, each with six sides. To convert an efficient, multi-pointed Heegaard diagram into a nice one, we apply a “stabilization trick” that was first described in [HKL07]. This trick consists of two steps:
- (1)
For each 6-sided bad region in , stabilize as in Figure 2(a) by attaching a 1–handle to with one foot in and another in a region containing a -basepoint. 2. (2)
Isotope the new -curves as in Figure 2(b) by applying finger moves across the -edges until reaching regions containing basepoints.
The resulting diagram after stabilizing and isotoping is nice [LSV13, Proposition 3.3].
2.3. The transverse invariant
Let be a transverse link in which is braided about the standard (disk) open book decomposition for . To this braid, we associate a multi-pointed Heegaard diagram , as above. We call a diagram obtained in this way a braid diagram.
In the context of Heegaard Floer theory, braid diagrams first appeared in the work of Baldwin, Vértesi and the second author [BVV13], and were used to establish an equivalence of transverse invariants in knot Floer homology. Observe that the diagram supports a distinguished generator , which is the union of the unique intersections between the and -curves contained on the disk . It was shown in [BVV13] that the class is an invariant of the transverse link . This invariant is denoted and is commonly referred to as the BRAID invariant of transverse knots. The Maslov and Alexander gradings of are given by
[TABLE]
where is the self-linking number of . The self-linking number of the closure of an -braid is
[TABLE]
where is the writhe.
In this paper, we work with the tilde version of knot Floer homology instead of . However, the generator determines a class in as well. Moreover, there exists a canonical projection map with corresponding section , such that .
3. Identifying the transverse invariant
Throughout this section, we assume that a transverse link is given as the closure of a braid . By abuse of notation, we let also denote an efficient homeomorphism in the corresponding mapping class.
3.1. The complexes
In this subsection, we inductively define a sequence of complexes and a sequence of chain-homotopy equivalences . The differentials on the complexes are defined analogously to those of , except that the counts associated to each Whitney disk are determined combinatorially. Similarly, the chain maps are defined analogously to standard triangle maps, except with modified counts for Whitney triangles.
Let be an efficient, multi-pointed Heegaard diagram for a braid closure. Via the “stabilization trick”, there is a sequence of multipointed Heegaard diagrams
[TABLE]
where
- (1)
\mathcal{H}_{s}=(\Sigma_{g},\mbox{\boldmath\beta}_{\rho}\cup\widehat{\mbox{\boldmath\beta}},\mbox{\boldmath\alpha}_{\rho}\cup\widehat{\mbox{\boldmath\alpha}},\mathbf{z},\mathbf{w}) is obtained from by simultaneous stabilizations in neighborhoods of the appropriate –basepoints on the disk ; 2. (2)
\mathcal{H}_{0}=(\Sigma_{g},\mbox{\boldmath\beta}_{0},\mbox{\boldmath\alpha}_{0},\mathbf{z},\mathbf{w}) is obtained from by handlesliding across the \widehat{\mbox{\boldmath\beta}} curves so that each intersects the original 2-sphere along an arc from the region containing to the unique hexagon in annulus bounded by and ; and 3. (3)
\mathcal{H}_{i}=(\Sigma_{g},\mbox{\boldmath\beta}_{i},\mbox{\boldmath\alpha}_{0},\mathbf{z},\mathbf{w}) is obtained from by an elementary isotopy of some across some curve. In addition, by a small Hamiltonian isotopy we can assume that each curve of \mbox{\boldmath\beta}_{i} intersects its corresponding curve in \mbox{\boldmath\beta}_{0},\dots,\mbox{\boldmath\beta}_{i-1} transversely in two points.
Finally, let \mathcal{H}_{0^{\prime}}=(\Sigma_{g},\mbox{\boldmath\beta}_{0^{\prime}},\mbox{\boldmath\alpha},\mathbf{z},\mathbf{w}) be a multi-pointed Heegaard diagram where the curves of \mbox{\boldmath\beta}_{0^{\prime}} are small Hamiltonian isotopes of the curves of \mbox{\boldmath\beta}_{0} which each intersect their counterpart in \mbox{\boldmath\beta}_{0},\dots,\mbox{\boldmath\beta}_{N} transversely in two points.
Each isotopy move from to introduces a pair of intersection points to \mbox{\boldmath\alpha}\cap\mbox{\boldmath\beta} as in Figure 3. Let be the submodule spanned by generators with a vertex at or and no vertices at any or for . Then, for each , there is a decomposition of modules
[TABLE]
In particular, when , we have . We additionally see that the modules have direct sum decompositions
[TABLE]
where is spanned by two generators satisfying . Define an increasing sequence of submodules
[TABLE]
for and . Endow each intermediate module with the map
[TABLE]
where is a modified count of representatives of the Whitney disk defined inductively as follows.
First, we set on to be exactly the differential on . Thus, define
[TABLE]
where denotes the moduli of pseudo-holomorphic representatives. For each pair of intersection points induced by the finger moves, there is a unique bigon 2–chain with corners at and . This bigon determines a Whitney disk . Inductively define the count by setting
[TABLE]
In defining the counts, we use the convention that .
Next, we define chain-homotopy equivalences between and each by a modified count of Whitney triangles. The three sets of curves \mbox{\boldmath\beta}_{i},\mbox{\boldmath\beta},\mbox{\boldmath\alpha}, along with the basepoints, determine a Heegaard triple. There is a unique generator of maximal Maslov grading, which is closed. Define maps by the rule
[TABLE]
The counts are again defined inductively. We set the map to be the induced chain homotopy equivalence from to . Thus, define
[TABLE]
We then define the triangle counts inductively using the formula
[TABLE]
We now state the main result of this subsection.
Proposition 3.1**.**
For any and ,
- (1)
* is a chain complex,* 2. (2)
* is a chain map, and* 3. (3)
* is a chain-homotopy equivalence.*
This proposition follows easily from the following two lemmas. First, we use a standard fact in homological algebra to contract differentials and simplify the complex.
Lemma 3.2** (Cancellation Lemma).**
Let be a chain complex with differential
[TABLE]
such that is a contractible complex with null-homotopy . Let be the complex with twisted differential
[TABLE]
Then, the maps and defined by
[TABLE]
are chain-homotopy equivalences.
Second, we establish the existence of a sequence of differentials to contract.
Lemma 3.3**.**
For any and , we have .
We defer the proof of Lemma 3.3 until the end of this subsection. Using Lemmas 3.2 and 3.3, we prove Proposition 3.1.
Proof of Proposition 3.1.
All three statements are clearly true for and since the differential and triangle map are defined by counting pseudo-holomorphic representatives.
To prove the proposition, suppose by induction that all three statements are true for . Let denote the restriction of to the submodule . Then we have that by Lemma 3.3. Consequently, is a contractible complex with null-homotopy defined by setting . Using the Cancellation Lemma (Lemma 3.2), we can contract to obtain a twisted differential on and a chain-homotopy equivalence . This twisted differential is precisely and . All three statements are now clear for . ∎
We now return to the proof of Lemma 3.3. In preparation, we show that, like the count of pseudo-holomorphic representatives, if the count associated to a Whitney disk or triangle is nonzero, then the corresponding domain in the Heegaard diagram is positive.
Lemma 3.4**.**
Let denote a Whitney disk in the diagram , let denote a Whitney triangle in the multidiagram determined by \mbox{\boldmath\beta}_{i},\mbox{\boldmath\beta}_{0},\mbox{\boldmath\alpha}, and let denote the bigon region in with corners at and .
- (1)
If the count is nonzero, then the 2-chain is positive. 2. (2)
If the count is nonzero, then the 2-chain is positive.
Proof.
We begin by observing that if is positive as a 2-chain in , then is positive as a 2-chain in .
Also, both statements are clearly true for since both the differential and triangle maps are determined by counting holomorphic representatives. If a holomorphic representative exists, then by positivity of intersection, the 2-chain corresponding to the Whitney disk or triangle must be positive.
Now, suppose by induction the statements are true for . If , then either , or there exist two domains such that and and are nonzero.
In the first case, then clearly is positive by induction. In the second case, we know by induction that and are both positive. We will show the stronger statements that and are positive. All curves are adjacent to -basepointed regions on both sides. Since , this implies that the multiplicity of can change by at most 1 across any segment of . In particular, pick two points as in Figure 3. Then . Moreover, since has an outgoing corner at , the multiplicities of must satisfy . However, since is positive, this means that . Thus . Consequently, the domain is positive. A corresponding argument shows that is positive. As a result, is positive.
A similar inductive argument proves the statement for triangle counts. ∎
We now finish the proof of Lemma 3.3.
Proof of Lemma 3.3.
First, the domain is clearly positive. If is any other Whitney disk, then is a periodic domain. Since the diagram is admissible, this periodic domain has both positive and negative multiplicities. Consequently, is positive if and only if the negative component of is precisely . However, this is not possible. If it was, then the boundary of the periodic domain must include the and curves bounding . Yet, each curve introduced by stabilization is not a linear combination in of the remaining and curves. Thus, it must show up with multiplicity [math] in the boundary of any periodic domain. In turn, is the unique Whitney disk in with a positive domain and, by Lemma 3.4, the only possible Whitney disk that could contribute to . Therefore, it sufficies to check that .
The count satisfies since embedded bigons have unique pseudo-holomorphic representatives. Proceeding by induction, we see that unless admits a decomposition for some Whitney disks with . If this occurs, then by Lemma 3.4, the domains are positive. However, since is an embedded bigon, this implies a finger move introduces two new intersection points on the boundary arc of between and . But it is clear from Figure 2(b) that this never occurs in the isotopy. Consequently, the count stays fixed at 1 for all . In particular, . ∎
3.2. Transverse invariant
In this section, we identify the image of the transverse invariant under the chain homotopy equivalences defined in the previous section.
Recall that is the generator of comprised of the distinguished intersections that lie on the portion of the original Heegaard surface coming from . There are corresponding generators in and in specified by the distinguished intersections along with the unique intersection points . Finally, for , let denote the subspace spanned by generators whose vertices along the curves are precisely .
Lemma 3.5**.**
Let and be the distinguished generators in , and , respectively, and let be the subspace spanned by generators containing the distinguished intersections . Then
- (1)
the chain homotopy equivalences and satisfy
[TABLE] 2. (2)
for all , the subspace is a subcomplex of ; 3. (3)
the chain homotopy equivalence satisfies
[TABLE] 4. (4)
for all , the subspace is a subcomplex of ; and 5. (5)
for all , the chain homotopy equivalence satisfies
[TABLE]
Proof.
Statements (2) and (4) follow from the same argument that is closed. Any domain with an outgoing corner at some vertex of must cross one of the basepoints and is therefore excluded from the differential. Statement (5) now follows immediately from Statement (4) and the definition of the map in Lemma 3.2.
Next, there is an obvious identification of the generators of and and since the stabilizations are performed in neighborhoods of –basepoints, the complexes and have identical differentials. Thus is a chain map that sends to . The chain homotopy equivalences and are determined by counting triangles. However, any triangle with vertices at and in Figure 4 that misses the basepoints must also have a third corner at . There is a unique such triangle, and it has a unique holomorphic representative. This proves Statements (1) and (3). ∎
This suffices to show that is a scalar multiple of . Thus, the transverse invariant is [math] if . To finish the proof of (main theorem), we need to prove the converse as well.
Proposition 3.6**.**
The chain-homotopy equivalence satisfies
[TABLE]
Proof.
By Lemma 3.5, we have that
[TABLE]
Thus, we need to determine which domains in contribute to the triangle map. The proof is similar to the proof of Lemma 3.3. Specifically, there is a unique positive domain , its contribution to is exactly , and its contribution to each successive map can never deviate from .
First, since \mbox{\boldmath\beta}_{0^{\prime}} consists of small Hamiltonian isotopes of \mbox{\boldmath\beta}_{0}, there is a obvious small triangle in . It appear as an embedded domain for every triple \mbox{\boldmath\beta}_{i},\mbox{\boldmath\beta}_{0},\alpha for . If is any other triangle in , then is a multi-periodic domain. If the domain is positive, then its boundary must include some curve with nonzero multiplicity. But each is linearly independent in from the remaining and curves. This gives a contradiction so is the unique positive domain.
Secondly, in the triple \mbox{\boldmath\beta}_{N},\mbox{\boldmath\beta}_{0},\mbox{\boldmath\alpha}, the domain appears and clearly has a unique holomorphic representative. Thus . Moreover, at no point in the isotopy from to does the triangle decompose into the sum of two positive domains and . This would require a finger move of some curve across the boundary arc of . but such a finger move never happens in the isotopy. Consequently, we must have that for all . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[BVV 13] John A Baldwin, David Shea Vela-Vick, and Vera Vértesi. On the equivalence of Legendrian and transverse invariants in knot Floer homology. Geom. Topol. , 17(2):925–974, 2013.
- 2[Ben 83] Daniel Bennequin. Entrelacements et équations de Pfaff. In Third Schnepfenried geometry conference, Vol. 1 (Schnepfenried, 1982) , volume 107 of Astérisque , pages 87–161. Soc. Math. France, Paris, 1983. Zbl 0573.58022.
- 3[Bir 74] Joan S. Birman. Braids, links, and mapping class groups . Princeton University Press, Princeton, N.J.; University of Tokyo Press, Tokyo, 1974. Annals of Mathematics Studies, No. 82.
- 4[BM 06] Joan S. Birman and William W. Menasco. Stabilization in the braid groups. II. Transversal simplicity of knots. Geom. Topol. , 10:1425–1452, 2006.
- 5[EF 98] Yakov Eliashberg and Maia Fraser. Classification of topologically trivial Legendrian knots. In Geometry, topology, and dynamics (Montreal, PQ, 1995) , volume 15 of CRM Proc. Lecture Notes , pages 17–51. Amer. Math. Soc., Providence, RI, 1998. Zbl 0907.53021.
- 6[Etn 05] John B. Etnyre. Legendrian and transversal knots. In Handbook of knot theory , pages 105–185. Elsevier B. V., Amsterdam, 2005.
- 7[EH 01] John B. Etnyre and Ko Honda. Knots and contact geometry. I. Torus knots and the figure eight knot. J. Symplectic Geom. , 1(1):63–120, 2001. Zbl 1037.57021.
- 8[EH 05] John B. Etnyre and Ko Honda. Cabling and transverse simplicity. Ann. of Math. (2) , 162(3):1305–1333, 2005.
