Cobordisms with chronologies and a generalisation of the Khovanov complex

Mathematics – Algebraic Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

89 pages, plenty of figures, Master's Thesis

Scientific paper

There are two categorifications of the Jones polynomial: "even" discovered by M.Khovanov in 1999 and "odd" dicovered by P.Ozsvath, J.Rasmussen and Z.Szabo in 2007. The first one can be fully constructed in the category of cobordisms (strictly: in the additive closure of that category), where we can build a complex for a given tangle and show its invariance under Reidemeister moves. The even link homology is given by a monoidal functor from cobordisms into modules. However, odd link homology cannot be obtained in this way. In this paper I fill this gap. I enrich cobordisms with chronologies (projections onto intervals which are Morse separable functions) and show that they form a category. Given a tangle diagram I take the cube of its resolutions and build a complex in this new category. I show this complex is a tangle invariant and applying appropriate functors I can recover both even and odd link homology theories.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Cobordisms with chronologies and a generalisation of the Khovanov complex does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cobordisms with chronologies and a generalisation of the Khovanov complex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cobordisms with chronologies and a generalisation of the Khovanov complex will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-57721

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.