Khovanov homology, wedges of spheres and complexity

Our main result has topological, combinatorial and computational flavor. It is motivated by a fundamental conjecture stating that computing Khovanov homology of a closed braid of fixed number of strands has polynomial time complexity. We show that the independence simplicial complex $I(w)$ associated to the 4-braid diagram $w$ (and therefore its Khovanov spectrum at extreme quantum degree) is contractible or homotopy equivalent to either a sphere, or a wedge of 2 spheres (possibly of different dimensions), or a wedge of 3 spheres (at least two of them of the same dimension), or a wedge of 4 spheres (at least three of them of the same dimension). On the algorithmic side we prove that finding the homotopy type of $I(w)$ can be done in polynomial time with respect to the number of crossings in $w$. In particular, we prove the wedge of spheres conjecture for circle graphs obtained from 4-braid diagrams. We also introduce the concept of Khovanov adequate diagram and discuss criteria for a link to have a Khovanov adequate braid diagram with at most 4 strands.

A fundamental difference between Alexander polynomial and Jones (and HOMFLYPT) polynomial is that Alexander polynomial can be computed in polynomial time while finding Jones (and HOMFLYPT) polynomial is NPhard [Ja, Wel].Thus computing Khovanov homology, a categorification of Jones polynomial, is NP-hard.At the moment, all existing programs computing Khovanov homology have exponential complexity (compare [BN]).Therefore finding an algorithm of polynomial time complexity for Khovanov homology of closed braids with a fixed number of strands, would be the game changer allowing posing and testing conjectures about structure of Khovanov homology.
Initial motivation for Conjecture 1.1 (a) comes from the fact that computing HOMFLYPT (and therefore Jones) polynomial of a closed braid with fixed number of strands has polynomial time complexity.Such polynomial growth algorithm was developed by Morton and Short in [MS], even if complexity was not discussed in that paper.
The second conjecture concerns the geometric realization of extreme Khovanov homology.Lipshitz and Sarkar introduced a graded family of spectra associated to a link diagram refining Khovanov homology [LS], called Khovanov spectra.Independently, in [GMS] it was introduced a method to associate to every link diagram D a simplicial complex I D so that its cohomology equals Khovanov homology of D at extreme quantum grading.This construction was proven to be equivalent to that of Lipshitz and Sarkar in extreme quantum grading [CS1].The following conjecture was formulated in [PS1].
Conjecture 1.2.The geometric realization of the extreme Khovanov homology (extreme Khovanov spectrum) is homotopy equivalent to a wedge of spheres (allowing empty wedge, i.e., a contractible set).
The construction in [GMS] involves the independence complex of certain circle graphs (not necessarily connected) called Lando graphs.By construction, Lando graphs turn out to be bipartite, so they are a proper subset of the family of circle graphs.The third conjecture, formulated also in [PS1], generalizes Conjecture 1.2 and it is formulated purely in the language of algebraic combinatorics.
Conjecture 1.3.(Wedge of spheres conjecture) The independence complex of a circle graph is homotopy equivalent to a wedge of spheres.
The fourth conjecture is essentially that of Adamaszek (compare to [AS]).However, he formulated it as a question, but our calculations and partial results gave us support to state it as a conjecture.Note that, by Theorem 2.5, Conjecture 1.4 implies Conjecture 1.1 (b) at extreme quantum grading.
Conjecture 1.4.The homotopy type of the independence complex of a circle graph can be found in polynomial time with respect to the number of vertices of the graph.
In this paper we solve Conjecture 1.1 in the case of extreme Khovanov homology and its geometric realization for 4-strands braids.As a byproduct of the paper we also solve Conjectures 1.2, 1.3 and 1.4 in those cases related to 4-strands braids.Our main result is the following: Theorem 1.5.Let w be a braid diagram on 4 strands and write ŵ for its closure.Then, the homotopy type of the geometric realization I(w) of the extreme Khovanov homology of ŵ can be computed in polynomial time.Moreover, if not contractible, I(w) is homotopy equivalent to either a sphere, or a wedge of two spheres, or S k ∨ S i ∨ S i , or S k ∨ S i ∨ S i ∨ S i , with k ≥ i.
As a consequence of the above result, we get the following corollary, that can be used to find criteria for links to have Khovanov adequate braid diagrams on 4 strands (see Section 9.1).
Corollary 1.6.Let β be a 4-strands braid diagram and β its closure.Then its extreme Khovanov homology Kh * ,j min ( β) is trivial or equal to Z, to Z where k ≥ i and [h] denotes the homological grading of Khovanov homology.
Observe that results in this paper are stated in terms of unoriented (framed) Khovanov homology (see Section 2 and compare to [Vir]).To get analogous result in terms of oriented version of Khovanov homology, one needs to adjust gradings as indicated in Remark 2.1.
The paper is organized as follows: In Section 2 we briefly review the definition of Khovanov homology of unoriented (framed) links following Viro [Vir] and recall the geometric realization of extreme Khovanov homology introduced in [GMS].
Section 3 is devoted to independence complexes of graphs.After recalling basic properties, we analyze the homotopy type of complicated graphs (e.g.augumented rhomboid graphs), which will be crucial in the proof of Theorem 1.5.In Section 4 we introduce some basic definitions concerning the braid monoid M n and Temperley-Lieb monoid M T L n ; this allows us to explain the scheme of the proof of Theorem 1.5 in Section 5.The proof is completed in Sections 6, 7 and 8.
We finish our paper with some applications and concluding remarks in Section 9.

Khovanov homology
We briefly review the definition of Khovanov homology of unoriented (framed) links following Viro [Vir] and recall the geometric realization of extreme Khovanov homology introduced in [GMS].
Let D be an unoriented link diagram with c ordered crossings.A Kauffman state s assigns a label, A or B, to each crossing of D, that is, s : cr(D) → {A, B}.Set σ(s) = |s −1 (A)| − |s −1 (B)| and let S be the collection of 2 c possible states of D. The resolution sD is the system of circles and chords obtained after smoothing each crossing of D according to the label assigned by s by following the convention in Figure 1.We write |s| for the number of circles in sD.
An enhancement of a state s is a map ϵ assigning a sign ±1 to each of the circles in sD.We sometimes keep the letter s for the enhanced state (s, ϵ) to avoid cumbersome notation.Write τ (s, ϵ) = Σϵ(r), where r ranges over all circles in sD, and define, for the enhanced state (s, ϵ), the integers The enhanced state s ′ is said to be adjacent to the enhanced state s if i(s ′ ) = i(s) − 2, j(s ′ ) = j(s), both states have identical labels except for one crossing v, where s assigns an A-label and s ′ a B-label, and they assign the same sign to the common circles in resolutions sD and s ′ D.
Let C i,j (D) be the free abelian group generated by the set of enhanced states s of D with i(s) = i and j(s) = j.For each integer j, consider the chain complex not adjacent to s and otherwise (s : s ′ ) = (−1) k , with k the number of B-labeled crossings in s coming after crossing v in the chosen ordering.It turns out that ∂ i−2,j • ∂ i,j = 0 and the corresponding homology groups Kh i,j (D) = ker(∂ i,j ) im(∂ i+2,j ) are invariants of framed unoriented links, and they categorify the unreduced Kauffman bracket polynomial.We refer to them as (framed) Khovanov homology groups of D. Let j min (D) = min{j(s, ϵ) | (s, ϵ) is an enhanced state of D}.We will refer to the complex {C i,j min (D), ∂ i } as the extreme Khovanov complex and to the corresponding homology groups Kh i,j min (D) as the (potential) extreme Khovanov homology groups of D. If we denote by s B the state assigning a B-label to every crossing of D, then j min (D) = −c − 2|s B |.
Remark 2.2.Note that the integer j min (D) depends on the diagram and may differ for two different diagrams representing the same link.It may happen that Kh * ,j min (D) = 0.
Next, we review the construction from [GMS] to describe a geometric realization of the extreme Khovanov complex in terms of certain simplicial complex.
Definition 2.3.Given a link diagram D, write s B for the state assigning a B-label to every crossing of D. The Lando graph of D, G D , is constructed from s B D by associating a vertex to each chord having both endpoints in the same circle 1 , and adding an edge connecting two vertices if the endpoints of the corresponding chords alternate in the same circle.See Figure 2(a-d).
The independence complex I(G) of a graph G is defined as the simplicial complex whose simplices are the independent subsets of vertices of G, that is, the subsets of pairwise non-adjacent vertices of G.For the empty graph If e, e ′ are two edges connecting the same pair of vertices, then I(G) = I(G − e).Moreover, the independence complex of the disjoint union of two graphs equals the join of their independence complexes, that is, Given a diagram D, the (simplicial) complex I D is defined as the independence complex of its associated Lando graph, i.e., I D = I(G D ). Figure 2(e) illustrates this definition.
1 The graph GD can be thought as the disjoint union of the Lando graphs arising from each of the circles appearing in sBD.Theorem 2.5.[GMS] Let D be a link diagram with c crossings, and set j = j min (D).Then, the chain complex {C i (I D ), d i } is isomorphic to the extreme Khovanov complex {C i,j (D), ∂ i }.In particular, It follows from [CS1] that the complex I D is stably homotopy equivalent to the Khovanov spectrum introduced by Lipshitz and Sarkar at its extreme quantum grading X j min (D) (see [LS]).Sometimes we refer to I D as the geometric realization of the extreme Khovanov homology of D, and to the homotopy type of I D as the extreme Khovanov homotopy type of the diagram.

Independence complexes
3.1.Basic results.We summarize some results concerning independence complexes which will be useful in the next sections (see e.g.[PS1]).
Given a vertex v of a graph G, write N G (v) for the set of adjacent vertices to v in G and define Lemma 3.2 (Domination Lemma).Let v, w be two vertices of a graph G such that v dominates w.
(1) If v and w are not adjacent in G, then where ∨ denotes the wedge of two simplicial complexes.
Domination Lemma is a consequence of the following more general result: 2 These are particular cases of the most general concept of link and star of a vertex in a simplicial complex.
A vertex v ∈ G of degree one is called a leaf and its unique adjacent vertex a preleaf.The following result is a direct consequence of Domination Lemma.
Corollary 3.4.Let w be a leaf of a graph G and let v be its associated preleaf.Then, Proposition 3.5 (Generalized Csorba).[Cso,PS1] Let G be a graph with two vertices v 1 and v 2 connected by a path L of length 3 (the two internal vertices of L having degree two), and let H be the graph obtained from G by contracting L. Then I(G) ∼ h ΣI(H).
We recall some results about the homotopy type of the independence complex of some well-known families of graphs: Proposition 3.6.[Koz] (1) Let L n be the n-path (i.e., the line graph consisting of n + 1 vertices connected by n edges).Then (2) If T is a forest, then its independence complex is either contractible or homotopy equivalent to a sphere.The exact homotopy type can be found in polynomial time by repeated use of Corollary 3.4.
(3) Let P n be the cycle graph of order n, that is, the n-gon.Then The following basic lemma on line graphs will be useful in Sections 3.2 and 8.1.
Lemma 3.7.Consider the line graph L n .
(1) Given a vertex v of L n , then either one of Another basic calculation concerns the θ-graph and its subdivisions, which we address in the following example.
Example 3.8.Consider the graph θ n 1 ,n 2 ,n 3 obtained from θ-graph by subdividing each of its edges into n 1 , n 2 and n 3 pieces, respectively (see Figure 3).The problem of computing I(θ n 1 ,n 2 ,n 3 ) can be reduced by Proposition 3.5 to a finite number of cases: 0 ≤ n 2 ≤ 2, 1 ≤ n 1 , n 3 ≤ 3. Analyzing each of them we conclude that I(θ n 1 ,n 2 ,n 3 ) is either contractible or homotopy equivalent to either a sphere or the wedge of two spheres (possibly of different dimensions).In particular, the only case leading to the wedge of two spheres of different dimensions is when n 1 ≡ n 2 ≡ n 3 ≡ 0 (mod 3), since θ n 1 ,0,n 3 = P n 1 ∨ P n 3 and thus Furthermore, observe that every proper subgraph G of θ n 1 ,n 2 ,n 3 can be reduced by Corollary 3.4 to either a forest or a polygon.Thus I(G) is either contractible or it is homotopy equivalent to a sphere or a wedge of two spheres of the same dimension.
In forthcoming sections we will make use of the following computation: In the topological part of this paper (Sections 7 and 8) we usually work with induced subgraphs of a given graph.However, sometimes we have to remove a special edge (keeping its endpoints).The next result allows us to do so in certain situations.Proposition 3.9.Consider a family of graphs G closed under taking induced subgraphs.Assume that for a given edge e of a graph G ∈ G any graph obtained from G by subdividing e (that is replacing e by L n , n ≥ 1) is also in G. Then G − e is also in G.
Proof.Starting from G, subdivide e into 2 pieces (i.e.replace e by L 2 ) and then remove the middle vertex of L 2 .The obtained graph is G − e and it belongs to G. □ 3.2.Fan, rhomboid and augmented rhomboid graphs.In this section we introduce some families of graphs whose independence complexes are crucial in Sections 7 and 8 when analyzing (extreme) Khovanov homotopy type associated to 4-braid diagrams.
The join of two graphs G 1 and G 2 , denoted by G 1 * G 2 , is the one skeleton of the join in the category of simplicial complexes.The cone G of a graph H is the join of H with an isolated vertex K 1 that we call apex of G, that is, G = cone 1 (H) = K 1 * H. Lemma 3.10.Let H be a non-empty graph and denote by K j the complete graph on j vertices.Then, Proof.The result follows from the fact that vertices in K j become isolated vertices in A graph is said to be a fan if it can be obtained from a simple fan by subdividing some of the edges of L n .See Figure 4.
It follows from Lemma 3.10 that Proposition 3.12.Let G be an induced subgraph of a fan.Then I(G) is either contractible or homotopy equivalent to the wedge of at most two spheres.
Proof  We next analyze the independence complex of each of the graphs defined above and these of their induced subgraphs.
Proposition 3.14.Let G be an induced subgraph of either a simple rhomboid SR n or a simple connected rhomboid SR con n and let is either contractible or has the homotopy type of a sphere or two spheres.Moreover, if we assume without loss of generality that v −1 ∈ G, then: is either contractible or has the homotopy type of either a sphere or the wedge of two spheres.In particular, I(G) can be homotopy equivalent to a wedge of three spheres only in the case (3b); moreover, such a wedge is of type S j ∨ S 0 ∨ S 0 , with j ≥ 0. Otherwise I(G) is either contractible or homotopy equivalent to either a sphere or the wedge of two spheres.
Proof.We use Domination Lemma (Lemma 3.2) and Corollary 3.4 in the proof.
(1) It is clear from Figure 5 that G is a forest with at most 5 edges and therefore the result holds. (2 and these two graphs are forests and Proposition 3.6(2) applies.In the particular case (a) (resp.(b)) the vertex v −1 is a leaf (resp.isolated) and the statement holds.
(3) Case (a) follows directly from domination of b ℓ over b r .Case (b) follows from Lemma 3.10 and the fact that G = K 2 * G spine .In case (c) G is an induced subgraph of a fan and Proposition 3.12 completes the proof. □ Next, we determine the homotopy type of the independence complex of the simple augmented rhomboid graph SR aug n and those of their induced subgraphs.
The case when the induced subgraph G does not contain all b 2 , b ℓ and b r is simpler, since it can be easily reduced to an induced subgraph of SR n or SR con n .In particular, if G = SR aug n − b 2 , applying twice Domination Lemma (v −1 > c 1 and v n+1 > d 3 ) and twice Csorba reduction (Proposition 3.5), we get SR con n .Analogous results hold for the cases SR aug n − b ℓ and SR aug n − b r .We will show that, up to some minor conditions, if the induced subgraph G contains b 2 , b ℓ and b r then I(G) can be obtained by recursive application of Proposition 3.3.More precisely, we will check the conditions when where each term can be computed easily, leading to either a sphere or contractible homotopy type.In particular, we get that I(G) has the homotopy type of four (resp.three) spheres if all four (resp.three) terms are not contractible.(1) Either I(G) is contractible or ( Proof.The statement follows from iterative application of Proposition 3.3.
In each step one needs to check that These conditions can be deduced from Lemma 3.17 (1) (2) otherwise. (3) ∈ G) and (c 2 and (c is either contractible or homotopy equivalent to a sphere S j for some j.In particular, for the latter case we get: Proof.In Figure 6 (1) I(G) is a wedge of four spheres if and only if b 2 , b ℓ , b r are in G, conditions A + and B + hold, and I(G spine ) is not contractible (that is I(G spine ) ∼ h S j for some j).Furthermore, we get where j ≥ 2. ( 2 Furthermore, we get I(G) ∼ h S j ∨ S 2 ∨ S 2 , where j ≥ 2.
The property that one of the spheres in Corollary 3.18 has equal or higher dimension than the others (i.e., j ≥ 2) can be proved using Lemma 3.7.
We present now two crucial examples: To obtain the formula above, observe first that since v −1 > c 1 and v n+1 > d 3 Domination Lemma applies and ) and Lemma 3.10(2) and Proposition 3.6(1) completes the proof.
Then the homotopy type of I(G) is the same as in the previous example, that is and after applying twice Csorba reduction we get Therefore, Proposition 3.3 applies and we get In the topological part of this paper (Sections 7 and 8) we need to consider induced subgraphs of more general augmented rhomboids (see Definition 3.24); essentially we allow subdivision of edges v i v i+1 , −1 ≤ i ≤ n.We also consider certain modifications of simple rhomboid graphs.Definition 3.21.We define the family of mod-augmented simple rhomboid graphs as those graphs obtained from an augmented simple rhomboid graph SR aug n after (possibly) a combination of the following transformations: (a) contract edge connecting v 0 and v −1 , (b) contract edge connecting v n and v n+1 , (c) delete edge connecting v 0 and v −1 , (d) delete edge connecting v n and v n+1 .
We can analyze independence complexes of induced subgraphs G of modaugmented simple rhomboid graphs in the same way we did with induced subgraphs of SR aug n .In fact, in most cases there is no need to repeat the whole proof, as those induced graphs obtained from modifications of SR aug n can be reduced to induced subgraphs of SR aug k with k ≤ n, as illustrated in the following example.
Next result summarizes the computations described before.
Corollary 3.23.Let G be an induced subgraph of a (mod-)augmented simple rhomboid graph.Then, there exists a polynomial time algorithm which determines the homotopy type of I(G).Moreover, if not contractible, I(G) is homotopy equivalent to either where k ≥ i.
Proof.Homotopy types follow from earlier results in this section.Moreover, all constructions in this section depended only on tasks performed in polynomial time (often linear or quadratic), for example finding a preleaf in the graph or checking whether one specific vertex dominates other.□ We finish this section introducing a family of graphs which will be obtained as Lando graphs of the closures of certain braids of 4 strands.These graphs are obtained from (augmented) simple rhomboid graphs by allowing subdivisions in the extended spine.
Definition 3.24.The rhomboid graph G(c ′ 0 , c 0 , . . ., c n+1 , c ′ n+1 ) is the graph obtained from the simple rhomboid graph SR n (Definition 3.13) by subdividing the edge connecting v i−1 to v i into c i parts, for 0 ≤ i ≤ n + 1, and the edges connecting v ′ −1 to v 0 and v n to v ′ n+1 into c ′ 0 and c ′ n+1 parts, respectively.See Figure 8.
If c i = 0 for some i, then vertices v i−1 and v i are identified (similarly for c ′ 0 = 0 and c ′ n+1 = 0), and we remove multiple edges.Analogously, we define (mod-)augmented rhomboid graph as those graphs obtained by subdivision along the extended spine of a (mod-)augmented simple rhomboid graph.Proposition 3.25.Let G = G(c ′ 0 , c 0 , c 1 , ..., c n+1 , c ′ n+1 ) be a rhomboid graph.Then the homotopy type of the independence complex of any induced subgraph H of G can be computed in polynomial time, and I(H) is either contractible or homotopy equivalent to a sphere or to the wedge of two spheres.
Proof.We introduce the notation We use Domination Lemma (Lemma 3.2) and Csorba reduction (Proposition 3.5) in the proof.We also apply Corollary 3.4 if possible, so we can assume that there are no leaves at any step of the process.
First step is to apply Csorba reduction to c i ∈ C I , so we can assume that these parameters are equal to 0, 1, 2 or ∞.We keep notation H for the reduced graph.
If c i = 2 for some c i ∈ C I , then b ℓ and b r dominates the vertex between v i−1 and v i , so I(H) ∼ h I(H − b ℓ − b r ) and Proposition 3.6(2) completes the proof.
Otherwise we can assume that c i ∈ C I equals 0, 1 or ∞.Now, we apply Csorba reduction to each element in C J , and reduce them to 0, 1, 2 or ∞ . If , where S is the square containing vertices b l , v −1 , v 0 and an additional vertex.The graph H − S is an induced subgraph of a fan, so Proposition 3.12 completes the proof.Analogous result holds for the case when other element in C J equals 2.
Otherwise, H is an induced subgraph of a simple rhomboid graph, and Proposition 3.14 completes the proof.□

Braid and Temperley-Lieb diagrams
The basic objects in this paper are n-braid diagrams which, from an algebraic point of view, are elements (words) of the free monoid generated by 2n − 2 letters with the identity element ε representing the empty word and geometric interpretation of generators as shown in Figure 9(a).We stress that braid group relations 3 do not hold in M n .Define the submonoids Given a word w ∈ M n , we write w + ∈ M + n for the word obtained from w by deleting those letters with negative exponents.We say that w is positive if w = w + ∈ M n .A subword 4 of w is the word consisting of some consecutive letters of w.
Define Mn as the quotient of M n modulo cyclic permutation of letters in a word.Given a word (braid diagram) w ∈ M n , we write w ∈ Mn for the associated cyclic word (closed braid diagram, which is also a link diagram).
Consider now the free monoid We say that φ( w) = (φ(w)) is the chord diagram of w.Observe that, if we write D = w, then φ( w) equals s B D from Definition 2.3 (compare to Figure 10).We write G(w) for the Lando graph associated to φ( w) and I(w) for its associated independence complex.
Braid relations are not allowed in M n because, in general, they do not preserve G(w) neither the homotopy type of I(w).In particular, second 3 Presentation of the braid group on n strands was given by Artin [Ar]: 4 Note that a subword of a cyclic word is not a cyclic word.and third Reidemeister moves can lead from a contractible independence complex to a non-contractible one.
Observe that negative third Reidemeister move (i.e., σ ) and relation σ ϵ i σ δ j ↔ σ δ j σ ϵ i where |i − j| > 1 and ϵ, δ ∈ {1, −1} preserve Lando graph.However, we decided not to incorporate them in the definition of M n as it could lead to confusion in Sections 7 and 8, where we consider positive braid diagrams allowing the possibility of decorating them with negative letters.

Main result and outline of its proof
The main result in this paper allows to fully characterize in polynomial time the extreme Khovanov homotopy type of closed 4-braid diagrams: Theorem 5.1.Let w be a braid diagram on 4 strands and write ŵ for its closure.Then, the homotopy type of the geometric realization I(w) of the extreme Khovanov homology of ŵ can be computed in polynomial time.Moreover, if not contractible, I(w) is homotopy equivalent to either a sphere, or a wedge of two spheres, or As a consequence of the proof we get the following result, which we prove in Section 7: Corollary 5.2.Given a positive braid diagram w ∈ M + 4 , the homotopy type of the geometric realization I(w) of the extreme Khovanov homology of ŵ can be computed in polynomial time.Moreover, I(w) is either contractible or has the homotopy type of either a sphere or the wedge of two spheres.
The first step in the proof of Theorem 5.1 is to define a class of braid diagrams that we call strongly-reduced (Definition 6.1) and give a polynomial time algorithm that, given a braid diagram w ∈ M n , either determines that I(w) is contractible, or reduces6 w to a strongly-reduced braid diagram w red so that there exists an induced subgraph H of G(w red ) with the property that I(w) is homotopy equivalent to the k th -suspension of I(H) for some k ≥ 0 (Corollary 6.6).This result allows us to restrict our study to strongly-reduced 4-braid diagrams.
Notice that a B-smoothing at a positive generator produces a horizontal smoothing with a vertical chord, while negative generators produce vertical smoothings with horizontal chords.Therefore, the shape of the circles in the B-smoothed diagram is determined by positive generators in w.For this reason, we first study Lando graphs arising from positive braid diagrams (Section 7).To do so, we classify strongly-reduced positive braid diagrams into six families, C 0 −C 5 (Proposition 7.1).We later extend this classification to strongly-reduced braid diagrams.
Next step is to study how negative letters of w contribute to G(w), i.e., how the graph G(w + ) is extended when adding negative letters to w + to obtain w.This addition can be done one at a time, since each negative letter corresponding to an admissible (horizontal) chord adds one vertex together with some edges to the Lando graph G(w + ).
Strongly-reduced 4-braid diagrams were classified into six families {C i } 5 i=0 .In Proposition 8.1 we determine G(w) and the homotopy type of I(w) for w ∈ C i with i = 0, 1, 2, 5.The cases when w belongs to C 3 or C 4 require more effort, and they are addressed in Section 8.1.In order to study the effect of each negative letter of w in G(w), we divide w into two parts, that we call head and tail (Definition 8.2).
We first prove Theorem 5.1 for the family of braid words having positive tail (Proposition 8.5).Finally, in Section 8.1.1 we deal with those negative letters appearing in the tail, showing that they can be eliminated (Proposition 8.15) and reducing this case to the previous one.Working with negative letters in the head of w leads to augmented and mod-augmented rhomboid graphs (see Definitions 3.21 and 3.24).Determining the homotopy type of the independence complexes of these families of graphs and those of their induced subgraphs is crucial in our work.This was analyzed in Section 3.2.

Strongly-reduced braid diagrams
In this section we introduce the set of strongly-reduced n-braid diagrams M red n and show that any braid diagram w can be reduced in polynomial time to an element w red ∈ M red n whose Lando graph G(w red ) allows to compute I(w) in polynomial time.Definition 6.1.Let w ∈ M n .
(a) w is positive square free if w does not contain a subword σ i w 1 σ i so that We say that w ∈ M n is strongly-reduced if it is square free (positive and negative), nesting free, and R 2 -reduced.Figure 11 illustrates this definition.
Observe that the set of positive strongly-reduced braid diagrams embeds into the set of strongly-reduced braid diagrams.Furthermore, if w ∈ M n is strongly-reduced, then so is w + ∈ M + n .Lemma 6.2.(Positive square reduction Lemma) Consider a braid diagram w ∈ M n that is not positive square free, and let the cyclic word w ∈ Mn contains the subword w 0 = σ i w 1 σ i where w 1 ∈ M n does not contain a letter σ j with |i − j| ≤ 1.Then (a) The chord diagram φ( w) has at least two components (circles) and one of them, say C 1 (see Figure 11(a)) has either Lando graph G C 1 ⊂ G(w) with an isolated vertex and thus I(G C 1 ) is contractible (this is the case when there is Proof.Write v 1 and v 2 for the vertices in G(w) corresponding to each of the letters σ −1 i in w 0 (in case these vertices do not belong in G(w), then the proof is trivial).It follows from Figure 11 , then I(w) ∼ h I(w ′ ).Compare to last paragraph in Section 4. Lemma 6.5.Let w ∈ M n be a braid diagram and w 0 be a subword of the cyclic word w: (a) (Nesting Lemma) Consider where σ j is neither in w 1 nor in w 2 , for |i − j| ≤ 1.Then, I(w) ∼ I(w ′ ), with w′ the word obtained from w by replacing w 0 by w ′ 0 = σ i w 1 σ −1 i w 2 .(b) Analogue of part (a) holds for the case when w 0 = σ −1 i w 2 σ −1 i w 1 σ i , with analogous conditions for w 1 and w 2 .
, with v σ i the vertex associated to σ i ∈ w 0 .In particular, I(w) ∼ h ΣI(H), where H is an induced subgraph of G(w ′ ) and w′ is obtained from w after replacing w 0 by σ i w 1 .(d) Analogue of part (c) holds for the case when w 0 = σ −1 i w 1 σ i with analogous conditions for w 1 .
Proof.Part (a) follows from the fact that the vertex corresponding to the second occurrence of σ −1 i in w 0 dominates the vertex corresponding to the first occurrence of σ −1 i , as shown in Figure 11(c); Domination Lemma completes the proof.
To prove part (c), see Figure 11(d) and notice that σ −1 i ∈ w 0 gives rise to either an isolated vertex in G(w), or to a leaf with preleaf v σ i , and Corollary 3.4 applies.□ Lemmas 6.2-6.5 provide an algorithm reducing a braid diagram to a shorter braid diagram which is strongly-reduced.The exact meaning of this reduction is described in the next corollary which allows us to restrict ourselves to the study of strongly-reduced braid diagrams.
Corollary 6.6.Given w ∈ M n , there exists an algorithm of polynomial time complexity which either (a) determines that I(w) is contractible, or (b) finds a strongly-reduced braid diagram w red by deleting some letters from w, so that I(w) ∼ h Σ k I(H), with H an induced subgraph of G(w red ) and k a non-negative integer given by the algorithm.

Positive braid diagrams on 4 strands
In this section we introduce a classification of strongly-reduced positive braid diagrams and use it to determine the homotopy type of the independence complexes associated to their closures.
Proposition 7.1.Let w ∈ M + 4 be a strongly-reduced positive braid diagram.Then, up to involution σ 1 ↔ σ 3 , there exists a representative w ∈ M4 of w in one of the following families: We say that w (and w) belongs to the corresponding class C i and write w ∈ C i , for 1 ≤ i ≤ 5.
Proof.Since w is strongly-reduced, w contains no subwords σ 1 σ 3 σ 1 .We start our classification from considering the number of σ 1 σ 3 (or σ 3 σ 1 ) occurrences in w: if there is none of such occurrences, then we get families C 0 , C 1 , C 2 .Families C 3 and C 4 (resp.family C 5 ) correspond to the cases when there is one (resp.at least two) of such occurrences.□ Proposition 7.2.Given a braid diagram w ∈ C 4 with a 1 > 1, there exists a braid diagram w ′ ∈ C 3 so that their associated Lando graphs G(w) and G(w ′ ) are isomorphic.
Proof.It is clear that involution σ 1 ↔ σ 3 , cyclic permutation and reading a word backwards preserve Lando graph of a braid diagram.The following chain of transformations completes the proof:

□
Observe that the statement in Proposition 7.2 is true for any stronglyreduced braid diagram, not necessarily positive.More precisely, given a braid diagram w such that w + ∈ C 4 the proof above produces a braid w ′ such that w ′+ ∈ C 3 .This will be useful in Section 8.
Proposition 7.3.Let w ∈ M + 4 be a strongly-reduced positive braid diagram.Then: (a) If w ∈ C 0 , then G(w) is either empty, if w is the trivial word, or a single vertex otherwise.
(e) If w ∈ C 4 , then G(w) is a rhomboid graph.In particular, For part (c) observe that if w ∈ C 2 , then φ( w) consists of two circles.Each factor (σ i σ 2 ) a j gives rise to 2a j chords (one of them non-admissible) yielding to a component L 2(a j −1) in G(w), for i = 1, 3 and 1 ≤ j ≤ 2k.
Parts (d) and (e) are illustrated in Figures 12-14.In these cases, φ( w) contains a single circle, vertices b r and b ℓ correspond to chords associated to subword σ 3 σ 1 .Spoke vertices correspond to chords associated to the last letter of factors of the form (σ i σ 2 ) a j in w, for i = 1, 3. Also, if a 1 = 1 then the vertex corresponding to the σ 2 occurrence in σ 3 σ 1 σ 2 is connected to b r instead of b ℓ , so c 0 = 2(a 1 − 1) becomes c ′ 0 = 2a 2 , as shown in Figure 13.
For part (f), observe that after performing a B-smoothing in the four crossings associated to two of the sets of occurrences σ 1 σ 3 (or σ 3 σ 1 ) in w, we obtain a disjoint sum of two 2-bridge diagrams, together with four nonadmissible chords.□ We finish this section with the proof of Corollary 5.2.
Proof of Corollary 5.2.The first step is to apply Corollary 6.6 to w to obtain w red .If w red belongs to families C 0 − C 4 then Proposition 3.6 and 3.25 complete the proof.If w red ∈ C 5 , we have I(w) = I(G(D 1 )) * I(G(D 2 )), with D 1 and D 2 two 2-bridge diagrams (see Proposition 7.3(f)).These diagrams represent alternating links, and therefore I(G(D i )) is either contractible or homotopy equivalent to a sphere (see [PS2]), for i = 1, 2. □

Considering negative generators
In this section we assume all braid diagrams to be strongly-reduced, i.e., w ∈ M red 4 .We write Moreover, the complexity of computing the homotopy type of I(w) is polynomial.
Proof.Part (a) is trivial.For part (b), recall that G(w + ) corresponds to a 2a-gon.σ −1 1 and σ −1 2 occurrences in w yields to either a leaf or a square sharing a side with the 2a-polygon corresponding to w + (see Figure 10).In both cases, the result holds by applying Domination Lemma together with Proposition 3.6.
For part (c), notice that vertices arising from negative letters in w do not connect the 2k paths in G(w + ).As in the previous case, σ −1 i occurrences giving rise to admissible chords yields to either leaves or squares sharing a side with one of the paths in G(w + ), for i = 1, 2, 3. Domination Lemma and Proposition 3.6(1) complete the proof.
For part (d) observe that negative σ −1 2 occurrences between the two letters in σ 1 σ 3 lead to non-admissible chords and therefore associated letters can be eliminated from w to obtain a new braid diagram w ′ with I(w) = I(w ′ ).Thus the statement follows from Proposition 7.3 and the proof of Corollary 5.2, since the diagrams D 1 and D 2 associated to w ′ are 2-bridge diagrams, and therefore represent alternating links.□ Computing the homotopy type of the independence complex of braid diagrams in families C 3 and C 4 is more involved and related to each other.We address these cases in the next subsections.
8.1.The case w ∈C 3 .In this section we consider those braid diagrams w on four strands which are strongly-reduced and such that w + belongs to the family C 3 from Lemma 7.1, that is, for some positive integers a i (with 1 ≤ i ≤ 2k) and k ≥ 1. Recall that we denote the above conditions as w ∈C 3 .Definition 8.2.Let w ∈C 3 .The head of w, denoted w H , is the unique subword of w in the form w H = σ 2 w 1 σ 3 w 2 σ 1 w 3 σ 2 , with w i ∈ M − 4 , for i = 1, 2, 3.The tail of w, w T , is the subword of w obtained by deleting the interior of the head w H (that is, following previous notation, we delete w 1 σ 3 w 2 σ 1 w 3 ).Proposition 8.3.Let w ∈C 3 , with head w H = σ 2 w 1 σ 3 w 2 σ 1 w 3 σ 2 , where w i ∈ M − 4 for i = 1, 2, 3.Then, strong reducibility of w implies that the options for w 2 are w 2 = ∅, w 2 = σ −1 2 or w 2 = σ −1 2 σ −1 1 σ −1 3 σ −1 2 .Moreover: 1) If w 2 = ∅, then the options for w 1 and w 3 are: 2 , then we have to consider, in addition to previous options for w 1 and w 3 , the following: , then the options for w 1 and w 3 are: Given a word w, we write w(j) for the j th letter in w and denote by n i the length of w i , that is, w i (n i ) is the last letter of w i , for i = 1, 2, 3.
See Figure 15.Since w is strongly-reduced (and therefore nesting free and R 2 -reduced) none of w i with i = 1, 2, 3 contains two repeated letters, with the unique possible exception of Figure 16 illustrates the Lando graphs of braid diagrams with maximal head and positive tail.Observe the graph (i) corresponding to maximal head (a) is an augmented rhomboid graph (Definition 3.24).Proposition 8.5.Let w ∈C 3 with positive tail w T .There exists a braid diagram w ′ ∈C 3 satisfying that w ′ H is a maximal head extending w H , w T = w ′ T and G(w) is an induced subgraph of G(w ′ ) (i.e, an induced subgraph of one of the graphs depicted in Figure 16).Moreover, the homotopy type of I(w) can be computed in polynomial time.
The first part of Proposition 8.5 follows from discussion above.The second part follows from the following propositions: Proposition 8.6.Let G be an induced subgraph of the graph in Figure 16(ii).Then I(G) is either contractible or has the homotopy type of either a sphere or the wedge of two spheres, and this can be determined in polynomial time.Thus, assume that the distance between two consecutive spoke vertices v i and v i+1 is either 0, 1 or ∞, in case they are not connected (recall Proposition 3.9), for 1 ≤ i ≤ n − 1.We keep the name G for the graph obtained after Csorba reductions in the spine.We focus now in the upper part of G (that is, the part involving vertices c 1 , c 2 , c 3 , e 2 , v 0 , in case they belong to G, and the vertices adjacent to them).The goal is to transform it into the upper part of an induced subgraph of a mod-augmented simple rhomboid graph (compare to Figure 5(b), illustrating an augmented simple rhomboid graph).We assume without loss of generality that vertex e 2 and edge r 1 belong to G and c 1 / ∈ G (otherwise, apply Corollary 3.4 and Domination Lemma over e 2 > c 1 if needed).
Next step is to apply Csorba reduction in the path connecting e 2 and the first spoke vertex v 0 ; we write c 0 for its distance: forest; thus, I(G − st(v s )) is either contractible or homotopy equivalent to a sphere.The fact that the dimensions of the spheres arising in I(G − v s ) are smaller or equal than the dimension of the sphere in I(G − st(v)) follows from Lemma 3.7.In particular, Theorem 5.1 holds for w.
(2) Case d = 1.See Figure 20(a).Spoke vertex v i dominates s, so I(G) ∼ h I(G − v i ).Graph G − v i can be thought as removing s from G together with edge e; applying Proposition 3.9 completes this case, allowing to remove vertex s. ( , which is contractible.Therefore, Proposition 3.3 applies and and therefore s can be removed. (4) Case d = ∞.In this case, there exist no path along the extended spine P connecting v s to any spoke vertex, for every spider s.Since G has no leaves (otherwise, we apply Corollary 3.4) Proposition 3.5 implies that there are essentially three possibilities: (i) There exist two spiders s 1 and s 2 so that v s 1 and v s 2 are connected by an edge.See Figure 21(a).In G − v s 2 the vertex v s 1 becomes a leaf and therefore which is either contractible or has the homotopy type of the wedge of at most 3 spheres of the same dimension, by Remark 8.14.
(ii) There exist two spiders s 1 and s 2 so that v s 1 and v s 2 are at distance 2. See Figure 21(b).Consider the graph G ′ obtained from G after collapsing the path of length 3 connecting s 1 and v s 2 , and write v ′ for the resulting vertex.By Proposition 3.5 we get that I(G) ∼ h ΣI(G ′ ), and since ).In G ′ − v ′ we apply Remark 8.14, while the graph G ′ − st(v ′ ) is a forest and then Proposition 3.6(2) applies.Lemma 3.7 implies that the dimensions of the spheres in I(G ′ − v ′ ) are smaller or equal than that of the sphere arising in I(G ′ − st(v ′ )).
(iii) There is a spider s connected by a path to vertex v −1 as shown in Figure 21(c).In this case we can think of G as the induced graph of an augmented rhomboid graph G ′ where spoke vertices are defined in terms of vertices of G as Repeated application of the methods described in this section (Lemma 8.10 together with discussion of cases depending on value of d) gives rise to the following result: Proposition 8.15.Given a braid diagram w ∈C 3 , there exists a polynomial complexity algorithm which either determines directly the homotopy type of I(G) and it satisfies conditions in Theorem 5.1, or it produces a braid diagram w ′ ∈C 3 with no negative letters in w ′ T with the property that I(w) is obtained from I(G ′ ), where G ′ is an induced subgraph of G(w ′ ).The precise way to obtain I(w) from I(G ′ ) is given by the algorithm and it consists of taking a finite number of suspensions and, possibly, a wedge operation.
Proposition 8.15 together with Proposition 8.5 complete the proof of the main theorem in the case when the given braid diagram belongs to the family C 3 and a 1 > 1.The remaining cases when w ∈C 3 with a 1 = 1 or w ∈C 4 follow in a similar manner (in fact, the case when w ∈C 4 and a 1 > 1 follows from Proposition 7.2).This completes the proof of Theorem 5.1.For convenience of the reader we finish this section with a sketch of the algorithm which, given a 4-braid diagram as input, determines the homotopy type of I(w) in polynomial time.

Concluding remarks and future directions
We believe that our main computational complexity conjecture (Conjecture 1.1) will be the central object of research for years to come.
The small steps we plan to address in the future is to work on almost extreme grades of Khovanov homology; compare to [CS2,PS2].The case of positive 5-braids and extreme Khovanov homology seems to be possible to approach today.Generally, some new techniques must be discovered for a general proof of Conjecture 1.1.There have been several unsuccessful attempts to prove the wedge of spheres conjecture (Conjecture 1.3), which seems to be rather difficult but very attractive.9.1.Khovanov adequate diagrams.We conjecture that links L whose Khovanov homology Kh * ,j min (L) is different from every group in the statement of Corollary 1.6 have braid index greater than four.Our results prove it only partially as in Corollary 9.2.Before its statement we introduce a formal definition of Khovanov adequate diagrams and links.Definition 9.1.A diagram D is Khovanov B-adequate if its Khovanov homology in quantum grading j min (D) = −c−2|s B | is not trivial.Analogously, D is Khovanov A-adequate if its Khovanov homology in quantum grading j max := max{j(s, ϵ) | (s, ϵ) is an enhanced state of D} is not trivial.A diagram satisfying both properties is said to be Khovanov adequate.
A link is Khovanov B-adequate (resp.A-adequate or adequate) if there exists a Khovanov B-adequate (resp.A-adequate or adequate) diagram representing it.
As a consequence of Theorem 5.1 we get the following result.
Corollary 9.2.Let L be a link so that the Khovanov homology of the lowest non-trivial row (i.e., the one with minimal quantum grading) is different from every group in the statement of Corollary 1.6.Then there is no Khovanov B-adequate braid diagram with 4 strands representing L.
We speculate that it is possible to find new criteria for the crossing number of Khovanov adequate links, generalizing the result by Lickorish and Thistlethwaite [LT].We hope that it will stimulate research in this topic.9.2.Remarks on topological complexity.Our initial approach to the complexity of finding the homotopy type of I D was via topological complexity of Smale [Sm].In that setting, an algorithm can be represented as a computation tree: a rooted tree growing down with the root (input) at the top and the leaves (output) at the bottom.Internal nodes are of two types: computational nodes and branching nodes, as shown in Figure 22.Computation nodes do not contribute to the topology of the computation tree, so the topological complexity of the tree is defined as the number of branching nodes.The topological complexity of a problem is the minimum topological complexity taken over all possible computation trees for that problem.In our case, branching nodes are associated to wedge operations.In fact, the reason for attraction to topological complexity is visible through the whole paper: we often analyze a vertex v of a graph G and study the homotopy type of I(G − v) and I(G − st(v)).In many case one of these simplicial complexes is contractible, so I(G) ∼ h I(G − v) or I(G) ∼ h ΣI(G − st(v)).From the point of view of computation tree, this corresponds to a computation node, which is not increasing topological complexity (we have this situation for example if v is a preleaf in G, as in Corollary 3.4).In some cases neither I(G − v) nor I(G − st(v)) is contractible, but we can prove that I(G − st(v)) is contractible in I(G − v), and therefore Proposition 3.3 leads to I(G) ∼ h I(G − v) ∨ ΣI(G − st(v)), corresponding to a branching node in the computation tree.It was, at least initially, rather unexpected for us that branching nodes were used seldom.In fact, they were never used more than three times, and this is related to the fact that in Theorem 5.1 the simplicial complex I(w) has the homotopy type of the wedge of at most four spheres.
We decided not to include topological complexity in the paper because if we extend initial data in our problem (for example, including homotopy type of simple rhomboid graphs), then we can argue that topological complexity is equal to zero, so we cannot really say that in our case topological complexity is equal to three.On the other hand, if right after a branching node the complex in one of the branches is immediately contractible, still one can count the branching node in the computation tree and therefore its complexity will have linear grow.

( a )
Computing Khovanov homology of a closed braid with fixed number of strands has polynomial time complexity with respect to the number of crossings.(b) Determining the homotopy type of the geometric realization of Khovanov homology (Khovanov spectra) of a closed braid with fixed number of strands has polynomial time complexity with respect to the number of crossings.

Figure 1 .
Figure 1.Smoothing of a crossing according to its A or B-label.A-chords (resp.B-chords) are represented by dark (resp.light) segments.

Remark 2. 1 .
The framed unoriented version of Khovanov homology is equivalent to its oriented version, which categorifies Jones polynomial.Framed and oriented version are related by Kh i,j (D) = H I,J ( ⃗ D), where I = w−i 2 and J = 3w−j 2 , with w the writhe of the oriented diagram ⃗ D.

Figure 2 .
Figure 2. (a) A link diagram D; (b)-(c) the resolution s B D; (d) the associated Lando graph G D ; (e) the geometric realization of I D .

Figure 4 .
Figure 4.The simple fan F n and a fan obtained from the simple fan F 3 are shown in (a) and (b), respectively.

.
Figure 5.The simple rhomboid SR n is shown in black in (a).If we additionally consider the grey edge connecting b ℓ and b r , then we get the connected rhomboid SR con n .The simple augmented rhomboid SR aug n is shown in (b).

v
n+1 .If H is an induced subgraph of G, then H spine denotes the intersection of H and the spine of G.
Proposition 3.15.Let G be an induced subgraph of SR aug n containing vertices b 2 , b ℓ and b r , and let G spine ̸ = ∅.Then: . □ Remark 3.16.The case when G is an induced subgraph of SR aug n with G spine = ∅ was discussed in Example 3.8, since after possible application of Domination Lemma (v −1 > c 1 and v n+1 > d 3 ), G becomes an induced subgraph of θ 4,2,4 .Lemma 3.17.Let G be an induced subgraph of SR aug n with G spine ̸ = ∅ and b ℓ , b r , b 2 ∈ G. Then the following conditions hold: we illustrate the graphs SR aug n −st(b 2 ), SR aug n −b 2 −st(b ℓ ), SR aug n − b 2 − b ℓ − st(b r ), and SR aug n − b 2 − b ℓ − b r .Statements (1), (2) and (3) follow from the analysis of Figure 6.To get statement (4) we analyze all different possibilities for G spine and apply Lemma 3.7.□ Proposition 3.15 and careful analysis of Lemma 3.17 allow us to fully characterize the induced subgraphs of SR aug n whose independence simplicial complexes are homotopy equivalent to a wedge of three or four spheres.

Figure 6 .
Figure 6.Graphs illustrating proof of Lemma 3.17 in the case when G = SR aug n .
) I(G) is a wedge of three spheres if and only if one of the following conditions holds: (i) b ℓ , b r are in G, b 2 / ∈ G, conditions A + and B + hold and I(G spine ) is not contractible.(ii) b r and (b ℓ or b 2 ) are in G, conditions A − and B + hold and I(G spine ) is not contractible.(iii) b ℓ and (b r or b 2 ) are in G, conditions A + and B − hold and I(G spine ) is not contractible.(iv) b 2 , b ℓ , b r are in G, conditions A + and B + hold and I(G spine ) is contractible.
Example 3.19.For the simple augmented rhomboid graph SR aug n (see Figure 5(b)) we get Example 3.22.Let G be the graph obtained from SR aug n after collapsing edge connecting v 0 and v −1 and removing edge connecting v n and v n+1 , as shown in Figure7(a).It is clear that v 0 > c 1 and v n+1 > d 3 in G, and therefore by Domination Lemma I as shown in Figure 7(b).

Figure 7 .
Figure 7. Modified augmented simple graph G illustrating Example 3.22 and its reduction SR aug k

Figure 9 .
Figure 9. Geometric interpretation of the generators of the monoid M n (a) and the monoid M T L n (b).
u 2 , ..., e n−1 , u n−1 }, whose elements are called Temperley-Lieb diagrams.The geometric interpretation of M T L n , shown in Figure 9(b), is motivated by that of the original Temperley-Lieb algebra 5 .As before, we define M T L n to be the quotient of M T L n modulo cyclic permutation.There is an isomorphism φ : M n → M T L n with φ(σ i ) = e i and φ(σ −1 i ) = u i .Domain and codomain of φ have different geometric interpretations: given a braid diagram w ∈ M n , φ(w) ∈ M T L n is a crossingless tangle diagram with additional chords.

Figure 11 .
Figure 11.Situations forbidden in chord diagrams associated to positive square free (a), negative square free (b), nesting free (c) and R 2 -reduced braid diagrams (d).Lemma 6.3.(Negative square reduction Lemma) Let w ∈ M n and w 0 = σ −1 i σ −1 i±1 σ −1 i be a subword of the cyclic word w.Then I(w) ∼ h I(w ′ ), with w ′ the braid diagram obtained from w by deleting one of the σ −1 i occurrences in w 0 .
where D 1 and D 2 are 2-bridge diagrams.Proof.Proof follows from direct analysis of the chord diagram φ( w) in each of the cases.Note that if w ∈ C 1 then φ( w) corresponds to the disjoint union of the chord diagram of the torus link T (3, a) and a circle, thus part (b) holds by [PS1, Corollary 7.7].

Figure 12 .
Figure 12.The chord diagram and Lando graph associated to

Figure 13 .
Figure 13.The chord diagram and Lando graph associated to

Figure 14 .
Figure 14.The chord diagram and Lando graph associated to is either contractible or homotopy equivalent to either one sphere or the wedge of two spheres of the same dimension.(c) If w ∈C 2 , then I(w) is either contractible or homotopy equivalent to a sphere.(d) If w ∈C 5 , then I(w) is either contractible or homotopy equivalent to a sphere.

Figure 15 .
Figure 15.A scheme of the chord diagram of a braid w ∈C 3 illustrating proof of Proposition 8.3.The cases (a), (d) and (e) for maximal heads w H described after Remark 8.4 are shown.

Figure 16 .
Figure16.Lando graphs associated to braid diagrams with maximal heads in the case when a 1 > 1. Graph (i) corresponds to case (a).Cases (b) and (c) are obtained from graph (i) after removing edge r 1 and r 2 , respectively.Removing r 1 and r 2 from (i) corresponds to case (d).Graph (ii) corresponds to case (e).

•Figure 20 .
Figure20.Graphs in the cases when the vertex v s associated to a spider s is at distance 1 and 2 from spoke vertex v i are illustrated in (a) and (b), respectively.An edge connected to the box represents four edges connected to each of the vertices in the box, in case these vertices are in G.

Figure 21 .
Figure 21.Graphs illustrating the graphs involved in the case when d = ∞.Cases (a), (b) and (c) correspond to situations (i), (ii) and (iii), respectively.As before, an edge connected to a box represents edges connected to each of the vertices in the box, in case these vertices are in the graph.

Figure 22 .
Figure 22.Nodes of a computational tree: computation node (left) and branching node (right).
2 e 1 e 2 u 1 u 2 e 1 e 2 u 1 u 2 ∈ M3 T L and the associated Lando graph G(w), with I(w) ∼ h S 2 .
Domination Lemma applies, allowing to eliminate the letter corresponding to the dominating vertex.
□Remark 6.4.Lemma 6.3 allows to apply classical braid relation on negative generators of M n , i.e., a negative Reidemeister 3 move.In other words, if w ′ is obtained from w by replacing σ −1