6.2 Computational shortcuts and cohomology of torus
links
Given a plane diagram , a straighforward computation of
cohomology groups is daunting. These groups are cohomology
groups of the graded
complex and the ranks of the abelian groups
grow exponentially in the complexity of
Probably there is no fast algorithm for computing
, since these groups carry full information about
the Jones polynomial, computing which is -hard ([JVW]).
Yet, one can try to reduce to a much smaller complex, albeit
still exponentially large, but more practical for a computation.
In this section we provide an example by simplifying in
the case when contains a chain of positive half-twists and
apply our result by computing cohomology groups of torus
links.
Let be a plane diagram with crossings and suppose that
contains a subdiagram pictured below
Four possible resolutions of these two double points of produce
diagrams :
Note that diagrams and are isomorphic and
is isomorphic to a union of and a simple
circle.
The complex is isomorphic to the total complex of the bicomplex
|
|
|
|
|
|
|
|
|
|
where the differentials and are determined by
the structure maps of the skew -cube
(where is the set of crossings of ).
Denote this bicomplex by
To simplify notation we denote the diagram by and
by
Then the bicomplex becomes
|
|
|
|
|
|
|
|
|
|
Clearly, the differential if restricted to
the subcomplex of is injective, and
so the total complex of the subbicomplex
|
|
|
(138) |
of is acyclic. Denote this subbicomplex by and the
quotient bicomplex by The total complexes and
of and are quasi-isomorphic, so to compute the
cohomology of it suffices to find the cohomology
of
We next give a precise description of the bicomplex
Let be maps of complexes
|
|
|
|
|
(139) |
|
|
|
|
|
(140) |
|
|
|
|
|
(141) |
induced by surfaces
and
respectively. Note that each of these maps have degree and
to make them homogeneous we need to shift gradings
of our complexes appropriately. We will use the same notations for shifted
maps since it will always be clear what the shifts are.
Let
|
|
|
(142) |
be the map of complexes
The map has degree Denote by and the compositions
|
|
|
(143) |
These are degree maps of complexes and for each they induce
degree maps also denoted and
0PLX
Lemma 2 The bicomplex is isomorphic to the bicomplex
|
|
|
(144) |
We skip the proof which is a simple linear algebra.
0PLY
Corollary 10 Cohomology groups are isomorphic to
the cohomology of the total complex of the bicomplex
(144).
We thus see that the cohomology
of the diagram can be computed
via the quotient complex of The quotient complex
is smaller than the original one and computing its cohomology requires
less work. This reduction is not drastic since ranks of homogeneous
components of complexes and have the same order
of magnitude, but a similar reduction (described next, when
contains a long chain of positive twists)
leads to an effective computation of for certain diagrams
Suppose that a diagram contains a chain of positive
half-twists
As before, denote by and diagrams that
are suitable resolutions of the -chain of
From our previous discussion we retain degree maps
and degree map
between (appropriately shifted) complexes and
Let be the bicomplex
|
|
|
|
|
|
|
|
|
|
where
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
i.e.
|
|
|
(145) |
0PLZ
Proposition 25 The complex is quasiisomorphic to the total complex
of the bicomplex Cohomology groups
are isomorphic
to the cohomology groups of
The proof goes by induction on induction base being given
by Corollary 10, and consists of finding a suitable
acyclic subcomplex to quotient by. We omit the details.
We conclude this section by applying this proposition to compute
cohomology groups of torus links. Fix and denote by
the diagram
of the torus link
The diagram is isomorphic to a simple circle and to a disjoint
union of two simple circles. Then is the operator
of multiplication by
and the bicomplex becomes a complex
|
|
|
|
|
|
|
|
|
|
Recalling that and we get
0PM0
Proposition 26 The isomorphism classes of the graded -modules
are given by
|
|
|