Almost-extreme Khovanov spectra
Abstract.
We introduce a functor from the cube to the Burnside -category and prove that it is equivalent to the Khovanov spectrum given by Lipshitz and Sarkar in the almost-extreme quantum grading. We provide a decomposition of this functor into simplicial complexes. This decomposition allows us to compute the homotopy type of the almost-extreme Khovanov spectra of diagrams without alternating pairs.
2010 Mathematics Subject Classification:
Primary 57M25, 55P421. Introduction
Khovanov homology is a powerful link invariant introduced by Mikhail Khovanov in [Kho00] as a categorification of the Jones polynomial. More precisely, given an oriented diagram representing a link , he constructed a finite -graded family of chain complexes
whose bigraded homology groups, , are link invariants. The groups are known as Khovanov homology groups of , and the indexes and as homological and quantum gradings, respectively.
In [LS14] Lipshitz and Sarkar refined this invariant to obtain, for each quantum grading , a spectrum whose stable homotopy type is a link invariant and whose cohomology is isomorphic to the Khovanov homology of the link, i.e., . Together with Lawson [LLS20] they gave a neat construction of this spectrum as the realization of a -functor from the cube category to the Burnside -category (see also [LLS17, LS18]).
Shortly after, another geometric realization of the (minimal) extreme Khovanov homology was given [GMS18] in terms of an independence simplicial complex constructed from the link diagram. This construction was later shown to coincide with the one of Lipshitz and Sarkar [CMS20] as follows: functors from the cube to the Burnside -category can be understood as generalizations of simplicial complexes; such a functor is a simplicial complex if it factors through the category of sets and takes values on singletons and the empty set.
On the other hand, the Khovanov spectrum of a link in its maximal extreme quantum grading is Spanier-Whitehead dual to that of its mirror image in minimal grading. This construction was exploded in [PS18] to make explicit computations of the Khovanov spectrum in (maximal) extreme quantum grading.
In 2018 the second author, together with Przytycki applied these techniques one step further, to the almost-extreme quantum grading. They restricted to the study of -adequate link diagrams, i.e., those whose -resolution contains no chords with both endpoints in the same circle (the extremal homology of these diagrams has been computed in [PS14, SS20, DL20]), and built a pointed semi-simplicial set whose homology is isomorphic to the almost-extreme Khovanov homology of the diagram:
Theorem ([PS20]).
If is a -adequate link diagram, then
-
(i)
The functor gives rise to a pointed semi-simplicial set.
-
(ii)
The realization of has the homotopy type of a wedge of spheres and possibly a copy of a (de)suspension of .
Their construction relates to the functor of Lawson, Lipshitz and Sarkar as follows: the category of pointed sets includes into the Burnside -category, and if a functor from the cube to the Burnside -category factors through it, then it gives rise to a pointed (augmented) semi-simpicial set.
Simplicial complexes and pointed semi-simplicial sets are simpler objects than functors to the Burnside -category, to which many classical tools can be applied, so these results prompt the question
Are there simpler models of the spectra of Lipshitz and Sarkar in the almost-extreme quantum grading?
Unfortunately, it turns out that gives rise to a pointed semi-simplicial set if and only if is -adequate. However, in this paper we overcome this problem by introducing a new functor , whose realization coincides with that of , and gives rise to an (augmented) pointed semi-simplicial set in a broader number of cases. This is achieved by constructing a natural transformation between and and proving the following result:
Theorem A.
The natural transformation is a homology isomorphism, and therefore the realizations of and are homotopy equivalent.
The functor can be understood as a “change of basis” of : The relevant generators of the Khovanov chain complex in its almost-extreme degree (which is the same as the chain complex of ) are indexed by the circles of the state resolutions of , whereas the generators of the chain complex associated to are indexed by the edges and connected components of certain graph whose vertices are the circles of the state resolutions. A crucial property at the almost-extreme quantum grading is that the relevant involved graphs are forests, and therefore both basis have the same size (as it should be).
The functor is simpler than in the sense that it takes values in morphisms sending generators to (multiples of) generators, whereas takes values in morphisms sending generators to sums of possibly different generators.
This simplified new basis allows us to decompose in terms of independence simplicial complexes of simpler link diagrams (Proposition 7.5 and Remark 7.6). The last part of the paper is devoted to make explicit computations using this decomposition.
One of the advantages of over is that it gives rise to an augmented pointed semi-simplicial set if and only if the -resolution of the diagram contains no alternating pairs (i.e., two chords whose endpoints alternate along the same circle). Moreover, the forementioned decomposition allows us to compute the homotopy type of the realization of in these cases:
Theorem B.
Let be a diagram whose -resolution contains no alternating pairs.
-
(i)
The functor gives rise to an augmented pointed semi-simplicial set.
-
(ii)
If is not -adequate then the realization of is homotopy equivalent to a wedge of spheres.
In [PS18] the second author conjectured (and proved for several cases) that the extreme Khovanov spectrum is always a wedge of spheres. If this conjecture were true, then the above decomposition would give an upper bound for the cone length of the spectrum (Remark 7.8). This bound seems to be far from optimal, as the computations of this paper and [PS20] produce spectra of cone length at most , so we rise the following question:
Are there diagrams whose almost-extreme Khovanov spectrum is not homotopy equivalent to a wedge of spheres and possibly (de)suspensions of projective planes?
The structure of the paper is as follows. In Sections 2 and 3 we recall the categorical notions that will be used along the paper. In Section 4 we develop some results on link diagrams which allow, in Section 5, to introduce the functor and prove Theorem A. In Section 6 we prove the first part of Theorem B. In Section 7 we decompose in terms of independence simplicial complexes and present three skein sequences which allow us to determine, in Section 8, the homotopy type of for all links with no alternating pairs, proving the second part of Theorem B.
Acknowledgments
The authors thank Carles Casacuberta for his guidance and advice at early stages of this project.
2. The Burnside 2-category
A -category is a higher category that generalizes the notion of category, in the sense that on top the objects and morphisms there are also -morphisms. More precisely, a -category consists of the data of
-
(1)
a collection of objects,
-
(2)
for each pair of objects , a category of morphisms ,
-
(3)
for each object , an object of and
-
(4)
for each triple of objects , a composition functor
which is associative and unital. The objects in are called -morphisms and the morphisms in are called -morphisms.
Recall that given two finite sets , a span from to is a triple where is a finite set, and and are a pair of functions .
We say that a span is free (resp. very free) if the source map is injective (resp. bijective).
Given two spans and , a fibrewise bijection between them is a bijection such that and :
The composition of two fibrewise bijections of spans is the composition of bijections, and the identity morphism of a locally finite span is the identity bijection. This defines a category of spans from the set to the set , which we note by .
Definition 2.1.
The Burnside -category, denoted by , is the -category whose objects are finite sets, and the category of morphisms from a set to a set is given by , the category of spans from to ; in other words, the -morphisms are given by spans and -morphisms are fibrewise bijections.
Let and be three sets in . Given a span in and a span in , their composition is given by their fibre product :
The composition of two fibrewise bijections and is also given by their fibre product as follows
and the identity on a set is the span .
Remark 2.2.
Note that a span from to is determined by the matrix whose entries are the sets , for every , . Giving a fibrewise bijection from a span to a span is the same as giving, for each and each , a bijection from to . The composition of and is the span with . The span is determined by the formal sum
for each . If a coefficient is not specified, we understand that (for example, if , then ).
The category of finite sets can be mapped into the category of pointed finite sets by sending to , and a morphism to the morphism that coincides with on and sends the basepoint of to the basepoint of . Moreover, the category sits inside by sending a pointed finite set to , and a morphism to the span
The inclusions induce equivalences between the following -subcategories of :
-
•
The essential image of in is the -subcategory of free spans.
-
•
The essential image of in is the -subcategory of very free spans.
Fix now a commutative ring with unit, and let -Mod be the category of modules over . There is a functor
(2.1) |
sending the finite set to the free -module , and a span to the homomorphism given, for every , by
Note that every pair of spans connected by a -morphism are sent to the same homomorphism, and therefore the functor is well-defined.
3. Cubes of pointed sets and augmented semi-simplicial pointed sets
The -dimensional cube is the partially ordered set (poset) whose elements are -tuples endowed with the standard partial order so that if for all . Following [LLS20], we regard as the category whose objects are the elements of this poset and, for any two such elements , the morphism set has a single element if , and is empty otherwise. This category has an initial element and a terminal element .
The poset map given by assigns a grading to each vertex in the cube. We write if and , and we write if, additionally, and differ in the th-coordinate, i.e., if , and for .
Given , , the finite ordinal is the linearly ordered set . The augmented semi-simplicial category, , has as objects these finite ordinals, and as morphisms injective order-preserving maps between them. The inclusion that forgets the -th element is called th-face map.
Definition 3.1.
Given a category , let denote its opposite category, obtained by reversing the morphisms. An -dimensional cube of pointed (finite) sets is a functor , while an augmented semi-simplicial pointed (finite) set is a functor . As usual, we write and for and , respectively.
These two categories are related by a functor which maps every vertex of the cube to the ordinal , and every morphism to the opposite of the th-face map.
Taking left Kan extension along the functor defines a functor
(3.1) |
whose value on a cube of pointed sets is defined explicitely as follows: its set of -simplices is , for every , and the th-face map is the union , where is the vertex of the cube obtained by replacing the th one in by a zero.
Recall from [LLS17, Definition 4.1] that a strictly unitary lax 2-functor from the cube to the Burnside category consists of the data:
-
(1)
a finite set , for each .
-
(2)
a finite span in , for each morphism in .
-
(3)
a -isomorphism from to , for each decomposition ;
satisfying that, for every , the following diagram commutes:
In practice, when defining a strictly unitary lax 2-functor, we use the following result, from [LLS17, Section 4]. We keep the notation for the morphism :
Lemma 3.2.
A strictly unitary lax -functor from the cube category to the Burnside category is uniquely determined (up to natural isomorphism) by the following data:
-
(D1)
for each vertex , a finite set ;
-
(D2)
for each , a finite span in ;
-
(D3)
for each two-dimensional face of the cube, a -morphism
satisfying the following two conditions:
-
(C1)
for every two-dimensional face ,
-
(C2)
for every three-dimensional face , the following commutes:
Definition 3.3.
[LLS17] A natural transformation between two strictly unitary lax -functors is a strictly unitary lax -functor such that and . For every , we denote by the morphism . For every , we denote the -morphism .
We write for the category whose objects are strictly unitary lax -functors from to and whose morphisms are natural transformations between them. When and the objects are called Burnside cubes.
3.1. Realizations and totalizations
Let be a model category, as the category of (pointed) topological spaces (resp. ), the category of spectra , or the category of chain complexes of -modules, with a commutative ring.
The totalization of a functor is the object of given by
This defines a functor
On the other hand, the relative realization of a functor is the object in given by
which defines a functor
A semi-simplicial object may be seen as an augmented semi-simplicial set by defining , the final object of . Its relative realization is the suspension of the realization of :
Recall now the functor mapping every to , and every morphism to the opposite of -face map. Since is cofinal, and , we have that
(3.2) |
3.2. From Burnside cubes to chain complexes
Let be a ring, and let be the category of chain complexes of -modules. There is a functor
where the first functor is , defined in (2.1), and the second functor sends an -module to the chain complex given by the -module concentrated at degree .
We define the functor as the composition
where the first functor is the result of composing a -functor from with .
Its value at the Burnside cube can also be described as the chain complex whose -cochains are
and whose differential is
Observe that since sends -morphisms to identities, a natural transformation between Burnside cubes induces a morphism of chain complexes.
3.3. From Burnside cubes to spectra
In [LLS20], Lawson, Lipshitz and Sarkar gave an explicit construction of the totalization functor for cubes in the Burnside category. They associated, to each cube , a spectrum , and to each map of Burnside cubes, a map , both well-defined up to homotopy. Additionally, the homology was isomorphic to the homology of , and the map induced by on homology was the one induced by .
Remark 3.4.
If is a homology isomorphism then is a homotopy equivalence of spectra.
On the other hand, in [CMS20] the authors showed that if a cube factors through some functor , then , where the homotopy colimit is taken in pointed topological spaces. Therefore, by (3.2), we have:
Proposition 3.5.
If a Burnside cube in the Burnside category factors through , then the pointed semi-simplicial set satisfies
4. Knots and graphs
4.1. States
Let be an oriented link diagram with ordered crossings , where () of them are positive (negative). A (Kauffman) state of the diagram is an assignation of a label, or , to each crossing in . The order of the crossings induces a bijection between the set of states of and the elements of by considering as the state that assigns the label to .
Smoothing a crossing of consists on replacing it by a pair of arcs and a segment connecting them; the way we smooth the crossings depends on its associated label , as shown in Figure 1. The result of smoothing each crossing of according to its label is the chord diagram , a collection of disjoint circles together with some segments that we call - and -chords, depending on the value of the associated . We represent -chords as light segments, and -chords as dark ones.

We introduce the following notation to refer to the circles and chords of :
-
•
denotes the set of circles of ,
-
•
denotes the set of -chords of ,
-
•
denotes the set of -chords of ,
-
•
denotes the th chord in ,
-
•
denotes the set of circles containing an endpoint of (thus is either equal to or ). If (resp. ), we say that is a bichord (resp. monochord).
Given a state of , we define its associated state graph, , as the labelled graph obtained by collapsing each circle of to a vertex so that each chord in becomes an edge in ; each edge inherits a label, or , from the associated chord. The circles and chords of are in bijection with the vertices and edges of . Therefore, the above notation introduced to refer to the circles and chords of will be used to refer to the vertices and edges of . In particular, the set of vertices of is and the set of edges labeled by and are and , respectively.
In this setting, write for the subgraph obtained after removing the -edges from . See Figure 2 for such an example. We consider loops as length-1 cycles.

Recall that given , we write if both vectors are equal in all but the coordinate, where and . The partial order is defined as the transitive closure of the above relation.
If , then is obtained from by doing surgery on along the -chord and adding a new chord . Observe that, depending on the cardinality of , there are two possible surgeries:

-
•
If , then and is obtained from by joining two circles into one. The graph is obtained from by identifying the two vertices in and adding a loop (the edge ) based on the identified vertex, as shown in Figure 3. We say that a merging.
-
•
If , then and is obtained from by splitting one circle into two. In this case, is obtained from by collapsing the edge , as shown in Figure 3. We say that is a splitting.
Remark 4.1.
Given two states and of so that , with , there exist possible chains
connecting them. However, the total composition of the one-by-one surgeries induced by each of the possible chains does not depend on the chosen chain.
Given a surgery , we compare and :
Definition 4.2.
Given a state with and a chain
(4.1) |
connecting to the state , we define as the number of loops in . In other words, counts the number of mergings in the chain.
Equalities above allow us to describe in terms of and :
(4.2) | ||||
(4.3) | ||||
(4.4) |
In particular, the above relations imply that does not depend on the chosen chain connecting the states and .
Lemma 4.3.
Let be a state of a link diagram .
-
(1)
If , then is a forest, namely, it consists of a collection of contractible components.
-
(2)
If , then the number of connected components of , , is either or . In addition:
-
(a)
If , then there is one single cycle in ,
-
(b)
If , then contains exactly two cycles and sharing a common vertex . Moreover, in the chords corresponding to the edges of adjacent to the vertex alternate with those of along the circle . Therefore the chords corresponding to the edges of and the chords corresponding to the edges of lie in different regions of .
-
(a)
Proof.
The assertions concerning the homotopy type of follow from (4.2) and (4.3) after computing the Euler characteristic of as
If , then by (4.4), and therefore contains no cycles. In the case (2a), , and therefore has a single cycle, whereas in case (2b), , and therefore there are two cycles in .
We prove now that when and , the chords of adjacent to the circle alternate with those of along the boundary of .
Consider a chain as (4.1), and let be the states right before and right after the merging is performed, respectively. Write and define as the (possibly empty) set containing those edges in the chain so that , for .
Since , we have just shown that consists on disjoint trees. When passing from to , vertices and are identified and the -edge becomes a -loop (i.e., a length-one cycle) in . Figure 4(a)-(b) illustrates this process.

The case corresponds to the case when and belong to different connected components of . Since no more mergings are possible, no more cycles are created. Moreover, the length of the (unique) cycle in is (see Figure 4(c)).
The case corresponds to the case when and belong to the same connected component: the fact that there is a path connecting and in implies that an additional cycle is created when identifying both vertices. As illustrated in Figure 4(b)-(c), the condition on the alternacy of the chords holds. The planarity of completes the proof. ∎
4.2. Enhanced states
An enhacement of a state is a map assigning a label or to each of the circles in ; we note by the associated enhanced state. Write and for the subsets of elements of labeled by and , respectively. Define, for the enhanced state , the integers
which are the homological and quantum gradings for Khovanov homology, respectively [LS14].
Let be the constant enhacement with value and, for a given circle , let be the enhacement assigning a positive label to every circle but . Sometimes we will write .
Define
and ; we refer to these numbers as extreme and almost-extreme (quantum) gradings for Khovanov homology of the diagram . It turns out that
and |
Proposition 4.4.
Let be an enhanced state of a diagram with . Then,
Proof.
Corollary 4.5.
Let be an enhanced state of satisfying . Then . Moreover,
-
(1)
if , then for some .
-
(2)
if , then .
Since we are interested in studying the almost-extreme Khovanov complex of a link diagram, in the next section we study the characterization of those states so that equals or .
4.3. States with
We are interested now in characterizing those states taking part in the almost-extreme Khovanov complex, i.e., given a state of , we want to determine whether there exists an enhacement so that , just by looking at .
Definition 4.6.
Given a state of and chords in , we say that:
-
(1)
and are parallel if they are bichords with their endpoints in the same circles, i.e., .
- (2)
-
(3)
form an alternating triple if and their endpoints alternate with the endpoints of the monochord along . See Figure 5 .
-
(4)
form a mixed alternating pair if the only alternating pairs among them are and . See Figure 5 .

Given states of , we write for the chord diagram having the same circles as , but only the -chords such that .
Remark 4.7.
If are states of , then implies that .
Proposition 4.8.
Let be a state of . Then, if and only if contains a bichord or an alternating pair, and if and only if contains at least one of the following configurations:
-
(1)
Two non-parallel bichords.
-
(2)
An alternating pair and a bichord.
-
(3)
An alternating triple.
-
(4)
Two disjoint alternating pairs.
-
(5)
A mixed alternating pair.
The proof of the necessary condition (i.e., the implication ) is a case-by-case straightforward checking. We use Lemmas 4.9 and 4.10 in the proof of the sufficient condition.
Lemma 4.9.
Let be three states with . Then:
-
(1)
If contains a bichord, then contains a bichord or an alternating pair.
-
(2)
If contains an alternating pair, then contains an alternating pair.
-
(3)
If contains an alternating triple, then contains an alternating triple or a mixed alternating pair.
-
(4)
If contains a mixed alternating pair, then contains a mixed alternating pair.
-
(5)
If contains an alternating pair and a bichord, then contains an alternating pair and a bichord, or a mixed alternating pair or two disjoint alternating pairs.
Proof.
Since , is a splitting for some monochord . The lemma follows from Remark 4.7 together with the following facts ():
-
-
If is a bichord, then either is a bichord or form an alternating pair.
-
-
If is an alternating pair, then is an alternating pair.
-
-
If is an alternating triple, then either is an alternating triple, or is a mixed alternating pair.
-
-
If is a mixed alternating pair, then is a mixed alternating pair.
-
-
If is an alternating pair and is a bichord, then either is an alternating pair and is a bichord or is a mixed alternating pair, or and are disjoint alternating pairs. ∎
Lemma 4.10.
Let be three states with . Then:
-
(1)
If contains a bichord, then contains two non-parallel bichords.
-
(2)
If contains an alternating pair, then contains an alternating triple or an alternating pair and a bichord.
Proof.
Since , is a merging for some bichord . The lemma follows from Remark 4.7 together with the following facts ():
-
-
If is a bichord, then and are non-parallel bichords.
-
-
If is an alternating pair, then either is an alternating pair and is a bichord, or is an alternating triple. ∎
Proof of the sufficient condition of Proposition 4.8.
Fix a chain
Consider first the case and write for be the minimal number such that is a merging. Therefore, is a bichord and applying Lemma 4.9 recursively, we deduce that contains a bichord or an alternating pair.
Consider now the case and write for the first two indices such that and are mergings. Therefore, , and applying recursively Lemma 4.9 to the bichord we deduce that contains a bichord or an alternating pair. Apply once Lemma 4.10 and deduce that contains at least one of the following: two non-parallel bichords or an alternating triple or an alternating pair and a bichord.
Finally, applying in each case recursively Lemma 4.9 we deduce that contains at least one of the following configurations:
-
(1)
Two non-parallel bichords.
-
(2)
An alternating pair and a bichord.
-
(3)
An alternating triple.
-
(4)
Two disjoint alternating pairs.
-
(5)
A mixed alternating pair.∎
4.4. Ladybug set
Let so that . If , recall from Lemma 4.3 that contains a unique cycle. We define the ladybug set of , , as the singleton consisting of the connected component of containing that cycle.
Consider now the case when . Then, by Lemma 4.3, contains two cycles and sharing a common vertex . Write for the edges of adjacent to , for (if is a loop, then ).
The chords divide the circle into four arcs (see Figure 6). We define the ladybug set of as the set whose elements are the two arcs of that are reached by traveling along any of the chords until , and then taking a right turn.

Remark 4.11.
In the case when and for , the set coincides with the right pair giving rise to the celebrated ladybug matching defined in [LS14].
Lemma 4.12.
If , and , then each arc in intersects one of the two arcs in and viceversa.
Proof.
Let . Since , all elements in are loops and none pair among them constitute an alternating pair.
By Lemma 4.3, contains two cycles and sharing a common vertex . Write for the circle in with the same property. Then is obtained from by performing surgery along the loops in with their endpoints in .
Write and let (resp. ) be the subset of loops of so that at least one of their endpoints lies in (resp. ). The disposition of and (stated in Lemma 4.3) implies that . Define the following subsets of :
The endpoints of each loop (resp. ) separate into two arcs: write for the unique arc in which is disjoint from (resp. from ). Define the following subsets of :
As there are no alternating pairs in , we deduce that
and |
As a consequence, we can consider two disjoint open subsets of such that
Each of the arcs of is obtained by doing surgery on each of the arcs of . The surgery performed on is supported in , while the surgery perfomed on is supported in . Since , it is possible to define (resp. ) as the arc of obtained from (resp. ). Thus, intersects , intersects and , as desired. ∎
4.5. The bijection
Given so that , then , and therefore it is possible to define a bijection in the following way:
-
(1)
If , then maps the unique element in to the unique element in .
-
(2)
If , then by Lemma 4.12 each of the two arcs in intersects one of the two arcs in . Write and , labelling the arcs so that and as subsets of (see Figure 7). The bijection is given by sending to and to . In particular, in those cases when none of the endpoints of the chord lie in nor , becomes the identity.

The following lemma follows immediately from Lemma 4.12:
Lemma 4.13.
Let so that . Then the following diagram commutes
4.6. The bijection
Given with , (i.e., a merging), we define a function
as follows:
-
(1)
If , then and we define as the unique constant function.
-
(2)
If , write , , and assume without loss of generality that and as subsets of . Then, we define the bijection by declaring , (see Figure 8).

The next result is a consequence of Lemma 4.12.
Lemma 4.14.
Let , . Then, the following squares commute:
-
(1)
If and , then111We defer the definition of some lines until the beginning of Section 5.
-
(2)
If and , then
5. Khovanov functors
In this section we review the functor given by Lipshitz and Sarkar in [LLS17, LLS20] and introduce a new Khovanov functor, giving a natural transformation between them which allows us to prove that the geometric realizations of both functors are homotopy equivalent at the almost-extreme quantum grading (Corollary 5.7). First, we introduce some notation.
Let be a state of a diagram so that . Orient by fixing, for each of its edges, one of its two possible orientations. We define, for each , the subgraph as the connected component of towards which is pointing. Note that is well defined, since Lemma 4.3 guarantees that has no cycles.
Given any two states of , there is an inclusion of the associated graphs , and we define the maps
(5.1) |
observe that the first one is an isomorphism if , while the second one is always injective. Additionally, if , there exists a Burnside morphism
mapping a circle either to itself if , or to if .
5.1. The Khovanov functor in almost-maximal grading
The key piece in the construction of the Khovanov spectra in [LLS20] was the Khovanov functor, whose associated stable homotopy type is a link invariant. Using Lemma 3.2, we restate now this functor, adapted to the particular case of the almost-maximal quantum grading.
Given a link diagram with ordered crossings, consider the functor222When working with different diagrams, we write to denote the functor associated to the link diagram .
defined, in a vertex , as333The original functor from [LLS20] splits into functors which associates to each state a set of enhancements so that , for every . When particularizing to the case when , Corollary 4.5 implies that if , then the set can be identified with , whereas if then . :
On a morphism , with , the span is given, for and , by
Finally, we specify -morphisms: Let and . We need to produce a 2-morphism between the 1-morphisms and .
Consider first the case when . If , , then the chords and form an alternating pair attached to some circle , so and . If and , then .
In the case , label the circles involved in the mergings and splittings as
Therefore,
Then, the 2-morphism consists of a bijection between and given by the ladybug matching (see Section 4.6).
If and we are not in the previous situation, then every summand in the formal sums and has a singleton as coefficient, so there is a unique choice for the 2-morphism .
In the case when , then and are empty if ; otherwise, both and map to the formal sum which has a singleton as coefficient.
The (strictly unitary lax) 2-functor defined above is the Khovanov functor given in [LLS20] at the almost-maximal quantum grading and, if has negative crossings, the almost-extreme (maximal) Khovanov spectrum is defined as
(5.2) |
5.2. A new equivalent functor
We introduce now a (strictly unitary lax) 2-functor , with the property that its realization coincides with the realization of , as will be show in Corollary 5.7. As before, we start by defining444When working with different diagrams, we write to denote the functor associated to the link diagram . for the vertices of the cube, corresponding to the states of :
On a morphism , with , the span is defined either on a connected component or an edge of (if ), or on the enhanced state (if ), as follows:
Remark 5.2.
Observe that the expression equals either , in the case when , or the empty set otherwise.
Remark 5.3.
Observe that the evaluation of the expression leads to either the empty set or one or two circles, as illustrated in Figure 9. When , there are two possibilities: if , then maps to one of the two arcs in ; however, if , then maps to the singleton .

Finally, given and , we define the 2-morphism between the 1-morphisms and as follows.
First, note that is trivially defined when or , since it is a bijection between singletons. Then, we just need to specify the cases when , and , depicted in Figure 10. Moreover, the value of and on a component equals the empty set or a singleton, unless is the component of containing two cycles; a similar reasoning applies for edges , unless (or possibly or ) points to the two circles involved in the unique merging. We define in such components and edges:

Lemma 5.4.
Proof.
Condition (C1) follows from the definition of . Consider an arbitrary three-dimensional face and denote its vertices as follows:
(5.3) |
In order to prove condition (C2), we need to show that -morphisms in this cube commute. To do so, we study the bijections obtained when we move along the cube. More precisely, starting from we move to and continue moving along the cube following Figure (11) until we reach again .

To simplify notation, write for the morphism if ; then, the commutative diagram of Lemma 4.13 associated to and becomes:
(5.4) |
We just need to study the cases when , and (otherwise, the coefficients involved in all compositions of -morphisms of the edges of the cube are singletons, and therefore the -morphisms commute trivially). In principle, up to permutation, there are 8 different situations attending to the value of in each vertex, depicted in Figure 12. However, it is not hard to check that situations , and leads to inconsistency in the chord diagrams, and therefore they are not possible. We study the remaining 5 possible situations:

-
(1)
Figure 12 (i.e., ): contains three monochords, two of them constituting an alternating pair. Coefficients involved in the three-fold compositions when moving around the cube are either singletons or the following:
The composition of the -morphisms connecting coefficients is the identity morphism.
-
(2)
Figure 12 (i.e., ): contains three monochords constituting two alternating pairs. Coefficients involved in the three-fold compositions when moving around the cube are either singletons or the following:
The composition of the -morphisms connecting coefficients is the identity morphism.
- (3)
-
(4)
Figure 12: contains one monochord and two parallel bichords not forming an alternating triple. Coefficients involved in the three-fold compositions when moving around the cube are either singletons or the following:
The composition of -morphisms is the boundary of the union of two squares of the form (5.4) along an edge, which commutes:
-
(5)
Figure 12: contains three parallel bichords. Coefficients involved in the three-fold compositions when moving around the cube are either singletons or the following:
The composition of -morphisms is the boundary of the union of three squares of the form (5.4) along their common edges, which commutes:
∎
Once we have defined , we will prove that its geometric realization is equivalent to that of the Khovanov functor . To do so, we introduce a natural transformation and show that the induced homomorphism is in fact an isomorphism (see Section 3.2).
Given a state , we set the natural natural transformation as follows:
Next, for each , we define a -morphism , i.e., makes the following diagram commute:
If and , is defined as the identity:
In the case when and we define as :
And when , is defined as the identity:
Lemma 5.5.
The natural transformation is well defined.
Proof.
We need to prove that satisfies conditions (C1) and (C2) in Lemma 3.2. Condition (C1) follows from definition of . Next, we prove (C2) by showing that -morphisms in the following cube commutes, similar as we did in proof of Lemma 5.4:
The commutativity is clear when all coefficients are singletons, i.e., it holds unless , and ; thus, we have to study the three following situations555The case is symmetric to (5.6)., corresponding again to the cases illustrated in Figure 10:
(5.5) | ||||||||||
(5.6) | ||||||||||
(5.7) |
Now, for each of the three cases above, we have to study the bijections obtained when we move along the cube: starting from , we move to , and continue moving along the cube following Figure 11, until we reach again .
We just need to consider the action of those compositions on the component such that contains two cycles (otherwise, the value of is trivial, as explained in the proof of Lemma 5.4).
Consider the case (5.5), where edges and form an alternating pair (see Figure 10). Then equals , and we obtain the following values when moving along the cube as in Figure 11:
We focus now in case (5.6), where is a loop and a bichord (Figure 10 shows an example of this situation). In this case equals , and we get:
Consider the third case (5.7), where and are parallel bichords, so (see Figure 10). Then , and we obtain:
Hence, showing the commutativity of the cube reduces to proving the following equalities in the corresponding situations:
The first line holds on the nose, whereas the second and third are a consequence of the commutativity of the following squares, proved in Lemma 4.14:
∎
Proposition 5.6.
is an isomorphism of chain complexes.
Proof.
Given a state with and a vertex in , write for the component of containing and write for the set of edges incident to . For each edge , set
The inverse of is:
The above proposition together with Remark 3.4 yield to the following result:
Corollary 5.7.
The spectra and are homotopy equivalent.
6. Pointed semi-simplicial sets
Definition 6.1.
A link diagram is -adequate (resp. -adequate) if (resp. ) contains no loops. is said to be adequate if it is both -adequate and -adequate. If is either -adequate or -adequate, it is called semiadequate. A link is said to be (semi)adequate if it admits a (semi)adequate diagram.
Proposition 6.2.
The functor factors through if and only if the diagram is -adequate. The functor factors through if and only if contains no alternatig pairs.
Proof.
From the definition of it follows that is not a function of pointed sets if and only if . This situation is avoided for all possible states if and only if for every state , or equivalently, if and only if contains no loops.
Now, looking at the definition of , we get that is not a function of pointed sets if and only if , and . This situation is avoided for all possible states if and only if contains no alternating pairs. ∎
Corollary 6.3.
If is 1-adequate, then is an iterated desuspension of the augmented semisimplicial pointed set (cf. [PS20]).
Corollary 6.4.
If has no alternating pairs, then is an iterated desuspension of the augmented semisimplicial pointed set .
7. Breaking up
In this section we introduce skein sequences for (Section 7.3). To do so, we decompose into subposets of the cube (Section 7.2), and compare one of them with the simplicial complex introduced in [GMS18] for extreme Khovanov homology.
7.1. The simplicial complex
Given a link diagram , in [GMS18] authors introduce a simplicial complex whose associated cohomology complex coincides with the Khovanov homology of the link in the minimal quantum grading. We restate that construction in terms of the maximal quantum grading .
Definition 7.1.
Let be a link diagram. Its associated Lando graph is constructed from by considering a vertex for every monochord, and an edge joining two vertices if the endpoints of the corresponding monochords alternate along the same circle. We define the independence complex666The independence complex is defined in terms of a graph. Hence, given a graph we define its associated independence complex as described in Definition 7.1. associated to , , as the simplicial complex whose set of vertices is the same as the set of vertices of and is a simplex in if and only if the vertices are independent in , i.e., there are not edges in between these vertices.
Note that can be thought as the disjoint union of the Lando graphs arising from each of the chord diagrams in after removing all bichords. Moreover, if , then , the join of both simplicial complexes.
Theorem.
[GMS18] Let be an oriented link represented by a diagram with positive crossings. Then
The poset of faces of the independence complex is precisely the subposet of the cube of those states for which .
Given a set of vertices , each simplicial complex on these vertices gives rise to a downwards closed subposet of (i.e., if a state belongs to the subposet and , then belongs to the subposet too): its poset of faces. Conversely, every downwards closed subposet of is the poset of faces of some simplicial complex.
Let be the full subcategory on and a singleton, and let be the full subcategory on the basepoint and . Downwards closed subposets of the cube are in bijection with functors . Subposets of the cube are in bijection with functors (see discussion in the final section of [CMS20], for example). The realization of a subposet of the cube is the desuspension of the totalization of its associated functor . Thus, the realization of a simplicial complex coincides with the realization of its poset of faces.
Given , we write for the state of satisfying , for .
Definition 7.2.
The categorical dual of a downwards (upwards) closed subposet is the upwards (downwards) closed subposet given by if and only if .
The complement of a downwards (upwards) closed subposet is the upwards (downwards) closed subposet given by if and only if .
The complement of the categorical dual of a downwards closed set is again a downwards closed subposet of the cube whose associated simplicial complex is the Alexander dual of . In general if is downwards closed and is Spanier-Whitehead dual to . Observe that
-
(1)
If , then ,
-
(2)
If , then , where is the dimension of the cube.
Given a link diagram , the upwards closed subposet of the cube given by those states such that , which we denote , corresponds to the functor .
Corollary 7.3.
is the categorical dual of the poset of faces of . As a consequence if , then .
7.2. Decomposing
Given a state of a diagram , recall that we write for the chord diagram having the same circles as and those chords so that . Given a crossing in , we write (resp. ) for the link diagram obtained after smoothing following a -label (resp. -label).
Definition 7.4.
Given a link diagram with crossings, we consider the following subposets of the cube :
-
•
: is the subposet of consisting of those states so that (as defined in previous section).
-
•
, for any monochord .
-
•
: is the subposet of consisting of those states so that and contains an alternating pair.
-
•
: is the subposet of consisting of those states so that and contains a bichord parallel to a given bichord of .
Observe that each state (admitting an enhacement) in the almost-extreme complex of belongs to one and only one of the previous subcubes or (see Corollary 4.5 and Proposition 4.8).
Proposition 7.5.
The functor can be realized as the following cofibre sequence
(7.1) |
where is the set of monochords in and the set of classes of parallel bichords.
The decomposition follows because the second map is levelwise injective and the suspension of the leftmost term is precisely the quotient functor of this second map.
Remark 7.6.
A Mayer-Vietoris spectral sequence allows to compute both posets and in terms of some posets , where are partially smoothed link diagrams of . We explain this below.
The poset can be covered with the subposets where runs along the set of all alternating pairs in . The -fold intersections of this covering are
where are monochords attached to the same circle in such a way that they can be divided into two non-empty sets and so that all monochords in alternate with all monochords in and viceversa. Similarly, the poset can be covered with the subposets where runs along the set of bichords of , and the -fold intersections of this covering are
where are bichords parallel to .
Thus, the (first page of the) Mayer-Vietoris spectral sequences associated to these coverings are:
Example 7.7.
Consider the torus knot and let be its standard diagram. Since contains no bichords, is trivial. We will combine Remark 7.6 together with Corollary 7.3 to compute the realization of subposets in (7.1). More precisely, we will express , and (via ) as the duals of independence complexes of some Lando graphs. Write for the cycle graph of vertices and the path of length .
-
-
;
-
-
, for any monochord in ;
-
-
when and are two consecutive monochords in . Note that alternating pairs consist precisely in consecutive monochords;
-
-
when are three consecutive monochords in . Note that the previous condition is equivalent to require that can be divided into two subsets and such that all monochords in each subset alternate with all monochords in the other subset.
Note that there are no -tuples of monochords which can be divided into two subsets and satisfying the condition above when .
Summarizing we have:
The homotopy types of the above complexes were computed in [PS18, Corollary 3.4 and Proposition 3.9]:
This allows to compute the almost-extreme Khovanov spectra of in terms of well-known independence complexes of cycles and paths, with no need to apply induction on .
Remark 7.8.
The cone-length of a spectrum is the least such that there is a sequence of cofibre sequences
for , such that is contractible, is a wedge of spheres and . In [PS18] it was conjectured that is homotopy equivalent to a wedge of spheres for any diagram . If this were true, then Remark 7.6 would imply that the cone length of is bounded above by the maximum of the following numbers:
-
(1)
the maximum number of parallel bichords plus one in .
-
(2)
the maximum number of monochords in that can be partitioned into two disjoint subsets such that all chords in alternate with all chords in and viceversa.
7.3. Skein sequences
Let be a crossing in a link diagram . Observe that if is a monochord in we get the skein short exact sequence777Compare to skein short exact sequences from [Vir04].
(7.2) |
whereas if is a bichord in , then the skein short exact sequence becomes
(7.3) |
Moreover, when is a monochord in we also have the following sequence:
(7.4) |
To verify the three above sequences note that the second map is an inclusion whose quotient is the suspension of the first spectrum.
Definition 7.9.
Let be a diagram and let be a monochord in . We say that is:
-
(1)
-free if it is not part of any alternating pair in .
-
(2)
-free if it is not part of any alternating triple in .
-
(3)
free if it is -free and -free.
-
(4)
-free if it is not part of any alternating triple involving the bichord in .
Lemma 7.10.
Let be a diagram and let be a monochord in .
-
(1)
If is -free, then and all , with a monochord, are contractible; if, additionally, contains another -free monochord, then is contractible too.
-
(2)
If does not form an alternating triple with a bichord (i.e., is -free), then is contractible.
Proof.
The leftmost map in skein sequence (7.4) along the crossing associated to is identity, hence is contractible. A similar reasoning works for when .
Corollary 7.11.
If contains at least two 2-free monochords, then
Corollary 7.12.
If has a free monochord , then .
Lemma 7.13.
Let be a 2-free monochord in dividing a circle into two regions so that both of them contain at least one 2-free monochord (we say that contains nested monochords). Then .
Proof.
We use skein sequence (7.2) and show that is contractible. First, notice that the circle in the statement is splitted into two circles and when changing the -label of for a -label, each of them attached to at least a -free monochord that we call and , respectively. Lemma 7.10(1) implies that the the only possibly non-contractible spaces when applying cofibre sequence (7.1) to are .
Definition 7.14.
Two parallel bichords and of a chord diagram are equivalent if there is no monochord so that and constitute an alternating triple.
Lemma 7.15.
If has two equivalent bichords , then .
8. Diagrams with no alternating pairs
In this section we determine the homotopy type of (thus, that of the Khovanov spectrum given by Lipshitz and Sarkar in [LS14] for the almost-extreme quantum grading) for diagrams so that contains no alternating pairs. Observe that this determines their Khovanov homology groups at almost-extreme quantum degree.
8.1. Diagrams with no monochords
8.2. Diagrams with one monochord
Proposition 8.1.
Let be a link diagram with crossings so that contains a single monochord attached to a circle , and let be the number of circles connected to along an alternating triple. Then,
Proof.
Write for the monochord in . By Lemma 7.10(1), the decomposition in (7.1) becomes
The subposet has a single element in degree , thus . By Lemma 7.10(2), is contractible unless forms an alternating triple with . Therefore we may assume, up to suspension, that all bichords are attached to and form an alternating triple with . Moreover, using Lemma 7.15 we can assume, up to suspension, that circles are connected to by exactly two bichords.
Therefore, for each such bichord , the subposet has five elements in M-shape, with two elements in degree and three in degree , thus , and the above decomposition becomes
The map to the wedge of spheres is a diagonal map. This concludes the proof. ∎
8.3. Diagrams with 2-free monochords
Let be a diagram whose associated chord diagram contains more than one monochord, all of them 2-free. Recall from Corollary 7.11 that in this situation , thus we can restrict to the independent study of each connected pair of circles when computing .
At this point we can make some simplifications in : Lemmas 7.13 and 7.15 allow us to remove nested monochords and equivalent bichords when computing (in exchange of taking suspensions). Moreover, by Lemma 7.10(2) we can assume that contains no -free monochords for any bichord . These simplifications motivate the following definition:
Definition 8.2.
A diagram is simple if the associated chord diagram contains at least two monochords, all of them 2-free, and satisfies the following conditions:
-
(1)
It contains exactly two circles;
-
(2)
It contains no nested monochords;
-
(3)
There are no -free monochords for any bichord ;
-
(4)
There are no equivalent bichords.
By definition, if is simple then can be isotoped in so that monochords and bichords lie in different regions (see Figure 13). Moreover, since contains no nested monochords, a circle with monochords is divided into half-disks (each of them bounded by a monochord and an arc of the circle) and an additional region (bounded by the monochords and arcs of the circle) that we call polygon.
Given a monochord in , we write for the half-disk bounded by 888If is the only monochord attached to the circle, then there are two possible options for ; in this case choose an option minimizing , without loss of generality., and for the number of bichords having one of their endpoints in . In simple diagrams for any monochord .

Lemma 8.3.
Let be a simple diagram whose associated chord diagram contains a monochord so that . Then is either contractible or homotopy equivalent to a sphere.
Proof.
Let be the only bichord with and endpoint in and consider the skein sequence (7.3) along :

The monochord is free in , thus by Lemma 7.10 is contractible, thus is contractible (by Corollary 7.11) and .
Now, has a single circle and its inner part is separated into two regions and by the monochord . See Figure 14(b). Moreover:
-
(1)
monochords in become internal monochords in ;
-
(2)
monochords attached to each of the circles in become monochords contained in each of the regions in ;
-
(3)
bichords in become external monochords in having one endpoint in and the other one in .
Consider now the skein sequence (7.4) along the monochord
Condition (3) above implies that there are no alternating pairs in (see Figure 14(c)), so the middle term in the above sequence is contractible and we have .
Assume first that connects with the region that we call polygon, then we claim that the Lando graph of , contains no cycles (i.e., it is a forest). In order to prove that, we proceed by contradiction. Suppose that is a cycle of length in , with vertices numbered so that is an internal chord in the region . Conditions (2) and (3) imply that monochords and lie in and , respectively. Moreover, the absence of equivalent bichords in implies the absence of cycles of length four in , i.e., . The monochord separates the external region into two subregions . Since there are no cycles of length , and lie one in each of these two subregions, say and . Moreover, as the internal monochords are non-nested, all internal monochords but and have both endpoints in either or . Therefore
-
(1)
the endpoints of lie in (because lies in ) and
-
(2)
the endpoints of lie in if (because lies in if ).
In particular, both endpoints of lie in . This is a contradiction, since is a external monochord connecting and . Therefore contains no cycles, and by [PS18, Corollary 3.7] its associated independence complex is either contractible or a sphere. Corollary 7.3 completes the proof.
Assume now that has its endpoints in two half-discs and , for some monochord , and consider the skein sequence (7.4) along . We get that is contractible, since all monochords in are 2-free. Therefore, . The latter is the same as , where is a diagram where connects with the polygon, which was studied in the previous case. ∎
Remark 8.4.
Since simple diagrams do not contain equivalent bichords, if for some monochord , then there exists a monochord with ( is connected to by a bichord). In other words, if for all monochords , then for all monochords .
Definition 8.5.
A simple diagram so that for every monochord of is called super-simple.

If is super-simple, every half-disk in satisfies one of the three following conditions:
-
(1)
, and both bichords connect with two contiguous half-disks in the other circle (see Figure 15(a));
-
(2)
, and one bichord connects with a half-disk in the other circle and the other one connects with the polygon in the other circle (see Figure 15(b));
-
(3)
, and two bichords connect with two contiguous half-disks in the other circle, and the third one is placed between them and connects with the polygon of the other circle (see Figure 15(c)).
Proposition 8.6.
Let be a super-simple diagram. Then is homotopy equivalent to a wedge of spheres.
Lemma 8.7.
Let be a super-simple diagram so that contains at least one bichord connecting a half-disk with the region called polygon. Then is either contractible or homotopy equivalent to a sphere.
Proof.
Let be a bichord connecting a half-disk in a circle with the polygon of the circle , for some monochord . See Figure 16. Since is super-simple, there exists at least a bichord connecting with for a monochord attached to . We distinguish two cases, depending on whether contains at least two monochords or it contains just a single monochord.
Case 1: Assume that the chord diagram contains more than one monochord attached to , and consider the skein exact sequence (7.3) along :

We will show that is contractible. To do so, we apply the skein sequence (7.4) along the monochord :
Figure 16 represents , where is a free monochord. Moreover, any monochord different from attached to becomes 2-free in , as illustrated in Figure 16. Therefore by Lemma 7.10(1) and are contractible, and so is .
As a consequence, . If in , then in , and the statment holds by Lemma 8.3. If in , then in and it contains a bichord connecting with for a monochord (contiguous to ) attached to the circle . Applying the skein exact sequence (7.3) along and repeating the same reasoning as before leads to . Since in , Lemma 8.3 completes the proof for this case.
Case 2: Assume that there is just one monochord attached to the circle in . Then, since is super-simple, is as one of the six chord diagrams depicted in Figure 17 (each picture leads to two possible chord diagrams, depending on whether it contains the bichord or not). In order to compute for each of these situations, we use skein sequence (7.3) together with Corollary 7.3. We also use [PS18, Lemma 3.2, Corollary 3.3] to compute :
- -
-
-
If is as in Figure 17 without : we proceed as in the previous case, and get that both and are contractible, and so is .
- -
-
-
If is as in Figure 17 without : the procedure is analogous to the previous one, the only difference is that and therefore .
- -
-
-
If is as in Figure 17 without : we proceed as in the previous case, and get that is contractible and . Therefore, . ∎

Lemma 8.8.
Let be a super-simple diagram so that all bichords in connect two half-disks (i.e., there are no bichords with an endpoint in the region called polygon). Then, is homotopy equivalent to a wedge of spheres. More precisely, if we write for the number of monochords in , then
Proof.
First, notice that since all bichords in connect two half-disks, the number of monochords equals the number of bichords. We label the chords as follows (see Figure 18): we write (resp. for the monochords attached to the circle (resp. ), and (resp. ) for the bichord having its endpoints in the half-disks and (resp. and ), for .
Consider the skein sequence (7.3) along the bichord :
(8.1) |
We study now the homotopy type of . Figure 18 shows the chord diagram , whose associated Lando graph is as depicted in Figure 18(c). Now, since vertex dominates999Following [PS18], given two vertices and in a graph, we say that dominates if the adjacent vertices to are also adjacent to . and vertex dominates , it follows from [PS18, Lemma 3.2] that the independence complex associated to is homotopy equivalent to the independence complex associated to the graph , which is a path of length , , whose independence complex follows from [PS18, Corollary 3.4]:
and by Corollary 7.3 we get:

Next, we compute the homotopy type of . Consider the skein sequence (7.3) along the bichord :

Figures 19 and represent the chord diagrams associated to and , respectively. Notice that is free and is -free in , hence is contractible by Lemma 7.10 and . The Lando graph associated to is depicted in Figure 19, and since vertex dominates and vertex dominates , we have the following equivalence relations:
and by Corollary 7.3 we get:
Theorem.
Let be a diagram so that the associated chord diagram contains more than one monochord, all of them 2-free . Then is homotopy equivalent to a wedge of spheres.
Proof.
Since all monochords are -free, then , by Corollary 7.11, so we consider each pair of discs in independently. Moreover, we can remove nested monochords and equivalent bichords when computing at the expense of taking suspensions (Lemmas 7.13 and 7.15). In addition, we can assume that contains no -free monochords for any bichord (otherwise, is contractible by Lemma 7.10(2)). Hence, we just need to prove the statement for simple diagrams. Lemma 8.3 and Proposition 8.6 complete the proof. ∎
References
- [CMS20] F. Cantero Morán and M. Silvero, Extreme Khovanov spectra, Rev. mat. iberoam. 36 (2020), no. 3, 661–670.
- [DL20] Oliver T. Dasbach and Adam M. Lowrance, Extremal Khovanov homology of Turaev genus one links, Fund. Math. 250 (2020), no. 1, 63–99.
- [GMS18] J. González-Meneses, P. M. G. Manchón, and M. Silvero, A geometric description of the extreme Khovanov cohomology, Proceedings of the Royal Society of Edinburgh: Section A Mathematics 148 (2018), no. 3, 541–557.
- [Kho00] M. Khovanov, A categorification of the Jones polynomial, Duke Math. J. 101 (2000), no. 3, 359–426.
- [LLS17] T. Lawson, R. Lipshitz, and S. Sarkar, The cube and the Burnside category, Categorification in geometry, topology, and physics, Contemp. Math., vol. 684, Amer. Math. Soc., Providence, RI, 2017, pp. 63–85.
- [LLS20] by same author, Khovanov homotopy type, Burnside category, and products, Geom. Topol. 24 (2020), 623–745.
- [LS14] R. Lipshitz and S. Sarkar, A Khovanov stable homotopy type, J. Amer. Math. Soc. 27 (2014), no. 4, 983–1042.
- [LS18] Robert Lipshitz and Sucharit Sarkar, Spatial refinements and Khovanov homology, Proc. Int. Cong. of Math. 1 (2018), 1151–1172.
- [PS14] Józef H. Przytycki and Radmila Sazdanović, Torsion in Khovanov homology of semi-adequate links, Fund. Math. 225 (2014), no. 1, 277–304.
- [PS18] J. H. Przytycki and M. Silvero, Homotopy type of circle graph complexes motivated by extreme Khovanov homology, J. Algebr. Comb. 48 (2018), 119–156.
- [PS20] by same author, Geometric realization of the almost-extreme Khovanov homology of semiadequate links, Geom. Dedicata 204 (2020), no. 1, 387–401.
- [SS20] Radmila Sazdanovic and Daniel Scofield, Extremal khovanov homology and the girth of a knot, arXiv:2003.05074v1, 2020.
- [Vir04] O. Viro, Khovanov homology, its definitions and ramifications, Fundam. Math. 184 (2004), 317–342.