A combinatorial proof of the invariance of tangle floer homology

Thumbnail Image
Journal Title
Journal ISSN
Volume Title
University of Alabama Libraries

The aim of this work is to take the combinatorial construction put forward by Petkova and Vértesi for tangle Floer homology and show that many of the arguments that apply to grid diagrams for knots can be applied to grid diagrams for tangles. In particular, we showed that the stabilization and commutation arguments used in combinatorial knot Floer homology can be applied mutatis mutandis to combinatorial tangle Floer homology, giving us an equivalence of chain complexes (either exactly in the case of commutations or up to the size of the grid in stabilizations). We then added a new move, the stretch move, and showed that the same arguments which work for commutations work for this move as well. We then extended these arguments to the context of A-infinity structures. We developed for our stabilization arguments a new type of algebraic notation and used this notation to demonstrate and simplify useful algebraic results. These results were then applied to produce type D and type DA equivalences between grid complexes and their stabilized counterparts. For commutation moves we proceeded more directly, constructing the needed type D homomorphisms and homotopies as needed and then showing that these give us a type D equivalence between tangle grid diagrams and their commuted counterparts. We also showed that these arguments can also be applied to our new stretch move. Finally, we showed that these grid moves are sufficient to accomplish the planar tangle moves required to establish equivalence of the tangles themselves with the exception of one move.

Electronic Thesis or Dissertation