Papers
Topics
Authors
Recent
Search
2000 character limit reached

Transverse braids and combinatorial knot Floer homology

Published 20 Mar 2017 in math.SG and math.GT | (1703.06861v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.