Commit Graph

7 Commits

Author SHA1 Message Date
Wojciech Politarczyk 203477c3a8 First shot at periodicity congruences
Verification of Przytycki's congruence works fine, however there are
some small modifications that could be made.

The, naive, approach to the verification of periodicity congruence for
the Khovanov polynomial didn't work. There are just too many cases to
check. Generation of all of them can exhaust the memory.
2016-11-24 15:28:31 +01:00
Joshua Batson 4fdd08f1d1 hi 2014-04-06 23:09:45 -04:00
Cotton Seed 36e0303fca Fixed crash on disconnected braid and possible loss of orientation
information when building braids.  knot parser supports disjoint union
(juxtaposition).  Minor documentation changes.
2013-03-26 12:44:40 -04:00
Cotton Seed f3d7e22f51 Strengthened b'_lk to use Khovanov homology. Set up to compute sp
bounds in paralllel.
2013-01-17 18:43:52 -05:00
Cotton Seed f2375a2d9e Added compute_forgetful_signs to main. Set up mpimain to compute
forgetful spectral sequence over Z/97 for all links with 14 or fewer
crossings.
2012-10-13 12:45:43 -04:00
Cotton Seed 0ed96458e1 Code to extract component(s) of links in knot_diagram. main.cpp set
to test inequality conjecture implied by forgetful spectral sequence
for Kh.
2012-02-23 19:04:13 -05:00
Cotton Seed dcbe4127bd First commit in git. This is a cleaned up version of r114 from the
now deprecated SVN repository.
2011-12-09 15:50:25 -05:00