Connectivity of triangulations without degree one edges

# Connectivity of triangulations without degree one edges under 2-3 and 3-2 moves

Henry Segerman
###### Abstract.

Matveev and Piergallini independently showed that, with a small number of known exceptions, any triangulation of a three-manifold can be transformed into any other triangulation of the same three-manifold with the same number of vertices, via a sequence of 2-3 and 3-2 moves. We can interpret this as showing that the Pachner graph of such triangulations is connected. In this paper, we extend this result to show that (again with a small number of known exceptions), the subgraph of the Pachner graph consisting of triangulations without degree one edges is also connected, for single-vertex triangulations of closed manifolds, and ideal triangulations of manifolds with non-spherical boundary components.

The author was supported in part by National Science Foundation grant DMS-1308767.

## 1. Introduction

Matveev [6, 7] and (independently) Piergallini [8] show that the set of triangulations of a three-manifold is connected under 2-3 and 3-2 moves, as long as we ignore the small number of triangulations of manifolds that consist of only a single tetrahedron. For these, no 2-3 or 3-2 move can be applied. Said another way, we consider the Pachner graph , whose vertices are the triangulations of a given manifold , where two vertices are connected by an edge if the corresponding triangulations are related by a 2-3 move. Matveev’s and Piergallini’s result then says that is connected, again if we ignore the one-tetrahedron triangulations.

A natural question to ask is whether this remains true when we impose conditions on the triangulations. In other words we consider the connectivity of the subgraph of corresponding to a given property. For example, we could consider the subgraph of geometric triangulations. Hoffman noted that the subgraph of geometric triangulations of the figure 8 knot complement is not connected; in fact there are isolated geometric triangulations (this observation is mentioned in [1]). However, geometricity is a very strong property. There are many weaker properties, corresponding to larger subgraphs, which may be connected. Of particular interest are the properties of 1-efficiency and of having essential edges. The 3D index is a recent quantum object mapping ideal triangulations to Laurent series, introduced by Dimofte, Gukov, and Gaiotto [3, 2]. Garoufalidis [9] showed that the 3D index is invariant under 2-3 and 3-2 moves, provided that it is defined on both sides of the move. In [5], Garoufalidis, Hodgson, Rubinstein and the author show that the 3D index is defined only on 1-efficient triangulations. Therefore, if we knew that the subgraph of corresponding to 1-efficient triangulations were connected, we would have an invariant of the manifold. Unfortunately this is not known. Also in [5], we define an extremely small subgraph of the 1-efficient triangulations that we can prove is connected, and since the subgraph is determined purely by the topology of the manifold, we have an invariant. However, this is a somewhat unsatisfying workaround. A very similar story holds for the 1-loop invariant, as defined by Dimofte and Garoufalidis [4]. In this case, the triangulations are required to have solutions to Thurston’s gluing equations corresponding to the complete hyperbolic structure, which is implied by the triangulation having essential edges. Again it is not known if the triangulations with essential edges form a connected subgraph of .

In this paper, we answer the connectivity question in the affirmative for the subgraph of triangulations with the property of having no degree one edges.

###### Theorem 1.1.

Let be an oriented three-manifold other than the lens space L(4,1). If is closed, let denote the set of single vertex triangulations of . If has boundary, let denote the set of ideal triangulations of . Exclude from any triangulations consisting of a single tetrahedron. Then the subgraph of consisting of triangulations without degree one edges is connected under 2-3 and 3-2 moves.

The restrictions on the manifold being orientable, and the triangulation being either ideal or having only a single vertex are likely not very serious. Most probably, a few other special cases would need to be ruled out. For brevity however, in this paper we restrict to these cases. The restriction ruling out L(4,1) is a special case, similar to the cases of single-tetrahedron triangulations. Most of the triangulations of the manifold L(4,1) that do not have degree one edges are in one large connected component, but there is also an infinite family of isolated triangulations without degree one edges, for which any 2-3 move would introduce a degree one edge. These triangulations have no degree three edges, and so there are no 3-2 moves to consider. We discuss this family in Remark 4.4.

The property of having no degree one edges is very weak, but is a prerequisite for a triangulation to have essential edges, or to be 1-efficient, or for most other properties of triangulations that have been investigated. We might hope that it will be possible to build up to connectivity of these stronger properties from weaker properties such as having no degree one edges.

## 2. Definitions and preliminaries

###### Definition 2.1.

A model triangulation is a set of identical oriented –simplices together with a set of orientation-reversing face pairings. A face cannot be glued to itself, and each face must be paired with another face. We refer to the quotient space after making the identifications given by the face pairings as a triangulation.

The simplices prior to identification, and their vertices, edges, and so on, are called model cells. The map of a model cell to its image in the triangulation need not be a homeomorphism – this occurs whenever a cell is glued to itself in some fashion.

An ideal triangulation is the result of removing the vertices from a triangulation, producing a manifold with boundary. For a closed manifold , we define to be the set of single-vertex triangulations. For a manifold with boundary, we define to be the set of ideal triangulations of , and we assume that has no spherical boundary components.

###### Remark 2.2.

A triangulation as defined above (i.e. with material vertices, rather than an ideal triangulation) is topologically a manifold if and only if the link of each vertex (i.e. the boundary of a small closed regular neighbourhood of the vertex) is a sphere.

###### Definition 2.3.

The degree of an edge , written , is the number of model edges that are identified to form .

In this paper, we will translate freely back and forth between a triangulation and its dual special spine.

###### Definition 2.4.

A spine of a manifold with non-empty boundary is a compact subpolyhedron , such that collapses to . For a closed manifold , a spine is a spine of the complement of an open ball in . If we are given a triangulation of a manifold, we obtain the dual (special) spine by inserting into each tetrahedron a butterfly. See Figure (a)a. A spine is simple if every point on a spine has a neighbourhood homeomorphic to one of the pictures shown in Figure (b)b.

A connected component of the set of non-singular points is a 2-stratum. A connected component of the set of triple points is a 1-stratum. A simple spine is special if each 2-stratum is an open disk and each 1-stratum is an open interval.

For further details on special spines and the moves on them described in this paper, see Matveev’s book, Algorithmic topology and classification of 3-manifolds [7].

###### Definition 2.5.

Let be a triangulation with at least two tetrahedra. A 2-3 move can be performed on any pair of distinct tetrahedra of that share a triangular face . We remove and the two tetrahedra, and replace them with three tetrahedra arranged around a new edge, which has endpoints the two vertices not on . See Figure (a)a. A 3-2 move is the reverse of a 2-3 move, and can be performed on any triangulation with a degree three edge , where the three tetrahedra incident to are distinct (i.e. the three model edges that are identified to form are edges of distinct model tetrahedra).

The focus of this paper is on connectivity of triangulations under the 2-3 and 3-2 moves. In order to organise the argument we will also consider a number of other moves, including the 0-2 and 2-0 moves, and (later) the V-move.

###### Definition 2.6.

Let be a triangulation. A 0-2 move can be performed on any pair of distinct triangular faces of that share an edge . Around the edge , the tetrahedra of are arranged in a cyclic sequence, which we call a book of tetrahedra. (Note that tetrahedra may appear more than once in the book.) The two triangles and separate the book into two half–books. We unglue the tetrahedra that are identified across the two triangles, duplicating the triangles and also duplicating . We glue into the resulting hole a pair of tetrahedra glued to each other in such a way that there is a degree two edge between them. See Figure (b)b. In Figure 3 we see the effect of the 0-2 move on the book of tetrahedra around . The figure shows a cross-section through the book, perpendicular to . A 2-0 move is the reverse of a 0-2 move, and can be performed on any triangulation with a degree two edge, where the two tetrahedra incident to that edge are distinct, and the two edges opposite the degree two edge are not identified.

###### Remark 2.7.

The 0-2 move is also called the lune move in the dual language of special spines.

###### Theorem 2.8 (Matveev [7, 6], Piergallini [8]).

Let and be two triangulations of a manifold, both of which have at least two tetrahedra, and which have the same number of vertices as each other. Then and are connected by a sequence of 2-3 and 3-2 moves.

Our goal is to modify a path of triangulations given by the above theorem to avoid degree one edges.

## 3. Anatomy of a degree one edge

By definition, a degree one edge is formed from a single model edge . The model tetrahedron that has as an edge has the two model faces incident to paired with each other. See Figure 4. Note that only one triangle of a triangulation containing a degree one edge is incident to that edge.

In order to avoid introducing degree one edges when performing 2-3 and 3-2 moves, it will be useful to know under what conditions a degree one edge can arise. A 2-3 move alters the degrees of at most nine edges of the triangulation: the nine edges of the two tetrahedra shown in the upper left of Figure (a)a. When a 2-3 move is performed, the degrees of the three “equatorial” edges go down by one, and the degrees of the other six edges go up by one. We say “at most nine edges” here, because there may be identifications among the edges, due to gluings not shown in Figure (a)a. Thus, in general, a 2-3 move can reduce the degree of an edge of the triangulation by up to three (if the three equatorial edges are identified with each other), while a 3-2 move can reduce the degree of an edge of the triangulation by up to six. However, any such large jumps down in degree cannot result in a degree one edge, as we will see in Corollary 3.2, which is derived from the following lemma.

###### Lemma 3.1.

There are two ways in which a degree one edge can be created, either via a 3-2 move or a 2-3 move. The two possibilities are shown in Figure 5. In both cases, all of the tetrahedra shown are distinct (i.e. each tetrahedron shown corresponds to a distinct model tetrahedron). The triangulations before and after these moves may or may not have identifications amongst the boundary faces of the collections of tetrahedra shown.

###### Proof.

We consider the reverse move: starting with a tetrahedron incident to a degree one edge , and considering which 2-3 or 3-2 moves can be applied to remove the degree one edge.

First, consider the possible 3-2 moves that involve (and therefore can affect ). In Figure 4, is labelled, as is its opposite edge . A 3-2 move can only be applied to a degree three edge, all of whose incident tetrahedra are distinct (i.e. three distinct model tetrahedra have model edges identified to form the degree three edge). Therefore we cannot apply a 3-2 move to , since its degree is incorrect, or to the other two edges incident to our tetrahedron, since the model tetrahedron has two of its model edges identified at each of these two edges. So the only possible edge that a 3-2 move can be applied to is . This move is shown in reverse in Figure (a)a. A 3-2 move results in two distinct tetrahedra, so we must start with two distinct tetrahedra when producing a degree one edge as in Figure (a)a.

Second, consider the possible 2-3 moves that involve (and therefore can affect ). Such a move must be performed on a triangle of the triangulation, whose two model triangles are on distinct model tetrahedra. Therefore we cannot use the one triangle incident to , and must use one of the other two faces of . Up to symmetry these give the same configuration. The reverse move is shown in Figure (b)b. The result of the 2-3 move consists of three distinct tetrahedra, so we must start with three distinct tetrahedra when producing a degree one edge as in Figure (b)b. ∎

###### Corollary 3.2.

A degree one edge comes from reducing the degree of a degree two edge by one. No single 2-3 or 3-2 move can convert any edge of degree higher than two into a degree one edge.

###### Proof.

Lemma 3.1 lists the two ways to produce a degree one edge, and in both cases the edge in question has degree two beforehand. ∎

###### Remark 3.3.

It is possible that a 3-2 move can make two degree one edges at once. A 2-3 move can also make more than one degree one edge, but only in a triangulation with multiple material vertices, or both ideal and material vertices.

## 4. Proof of the main theorem

In this section, we prove Theorem 1.1. We first describe the general strategy of the proof, with details to come in the subsequent pages.

We are given two triangulations and of a manifold , neither of which has a degree one edge, and we must find a path of 2-3 and 3-2 moves which connects from one to the other, and which does not pass through a triangulation with a degree one edge. Theorem 2.8 gives us the existence of a path connected by 2-3 and 3-2 moves, although some of the intermediate triangulations may have degree one edges. Our plan is to modify the path to detour around any such triangulations.

First, observe that the tetrahedron incident to a degree one edge is unchanged for the entire lifetime of the degree one edge. Any 2-3 or 3-2 move that alters is one of the moves shown in Figure 5, as we saw in the proof of Lemma 3.1. This means in particular that the triangle incident to is also unchanged for the lifetime of the degree one edge.

Suppose at first that there are no degree one edges in the path from to . Suppose that a single degree one edge is introduced in the triangulation , persists until , and then is removed in . Let the single triangle incident to be called . We take a detour from , performing a sequence of moves (which do not go through any triangulations with degree one edges) that results in a triangulation . This triangulation is identical to , other than that the triangle has been unglued, and a triangulation of a three-ball with boundary consisting of two triangles is glued onto the two revealed faces of the triangulation. Said another way, we unglue the triangle , and insert a triangular pillow. Our triangular pillow must not have any degree one edges inside of it. The act of gluing it in where was increases the degree of the three edges incident to .

We now continue the path , with in place of . The next move no longer produces a degree one edge, since the degree of has been increased by the insertion of the triangular pillow. As we continue this parallel path to the original , no moves alter the triangular pillow, by our previous observation about the fact that is unchanged for the lifetime of the degree one edge.

We continue, up until we get to the triangulation , which is the same as with unglued and the triangular pillow inserted into the resulting hole. After this move, we remove the triangular pillow by another sequence of moves, that converts back into (this is precisely the reverse process to that of inserting the triangular pillow). Having completed our detour, we continue with the path , until we reach . The resulting path then has no triangulations with degree one edges.

If we can perform the above detour, then we can similarly deal with paths with multiple degree one edges, even multiple produced on the same move. All we need to do is apply the move of inserting a triangular pillow for each degree one edge in turn, leaving it there for the lifetime of the degree one edge, then remove it immediately afterwards.

Given this strategy, all we need to do is describe our triangular pillow, and show how it can be inserted into the triangle incident to an edge just before the degree of is to be reduced to one, all without introducing any degree one edges in the process.

### 4.1. The triangular pillow

First, we describe the triangulation we use for our triangular pillow. Figure 6 shows a bird beak, which is two tetrahedra arranged around a degree two edge. On the right we draw the bird beak in a suggestive manner – rotating the upper half down so that it looks more like a real-life bird’s beak. In Figure 7, we glue together two bird beaks, interleaving the mandibles of each beak. The resulting triangulation of the three-ball has two triangular faces on its boundary, and has no degree one edges in its interior. Ungluing a triangle of a triangulation and inserting this triangular pillow adds three, three, and eight to the degrees of the edges incident to .

### 4.2. The V-move

We must insert our triangular pillow using 2-3 and 3-2 moves. As a first step, we introduce a bird beak. We use Matveev’s V-move [7, Figure 1.13]. The effect of the V-move is shown in Figure 8: it wraps a bird beak around two faces of a tetrahedron. Note that there is a symmetry in the resulting three tetrahedra: we can also see this as wrapping a bird beak around the opposite two faces of the same tetrahedron. There are three different possible V-moves to apply in a tetrahedron, because there are three pairs of opposite edges.

The V-move can be implemented using 2-3 and 3-2 moves, assuming that the triangulation has more than one tetrahedron. The process is easier to understand in the dual setting of special spines. Figure 9 shows the V-move again, with both the triangulation and the special spine shown. Vertices, edges and faces of the dual spine correspond to tetrahedra, faces and edges of the triangulation.

###### Lemma 4.1.

Let be a face of a triangulation which has no degree one edges. Suppose that is incident to two distinct tetrahedra , and suppose that the edges of (which may not be distinct) all have degree at least three. Then we can perform any of the three V-moves in either or by sequences of 2-3 and 3-2 moves, none of which introduce a degree one edge at any point.

###### Proof.

Figure 10, adapted from [7, Figure 1.15] shows the process of implementing the V-move with 2-3 and 3-2 moves, using the dual spine to the triangulation. By inspection, we can check that only the three faces marked with a have their degree reduced below their starting value during the process, and only by one, during the first 2-3 move. (In the dual picture, these three faces correspond to the three edges of the triangle .) Of the new faces added, the smallest degree we see is two. Moreover, by Corollary 3.2, even if there were identifications between the faces marked , the only way that such a face could become degree one is if it were degree two at the start. By assumption, this is not the case. ∎

### 4.3. Rotating the mandibles of a bird beak

With the V-move, we introduce a bird beak, wrapped around two faces and across their common edge of a tetrahedron. We can think of the introduction of the bird beak as a 0-2 move (as in Definition 2.6), and so it splits the book of tetrahedra around into two half-books, one of which contains only the one tetrahedron we wrapped the bird beak around.

We will also need to be able to rotate the mandibles of the bird beak around in the split book of tetrahedra, effectively moving tetrahedra from one half-book to the other. This will let us close the mandibles on each other and make our triangular pillow. The move shown in Figure 11 achieves this goal, allowing us to move one mandible of the beak from one side of a tetrahedron to the other, assuming that this third tetrahedron is distinct from the two tetrahedra of the bird beak. The move is shown in the dual picture in Figure 12, which is adapted from [7, Fig. 1.18].

###### Remark 4.2.

The move shown in Figure 11 does not allow us to rotate the two mandibles of a single bird beak past each other. Here the configuration to consider involves a model triangle , two of whose edges are identified to form a single edge of the triangulation. If we perform a 0-2 move, inserting a bird beak and splitting apart the book of tetrahedra around , it can happen that the two mandibles of the beak are glued to each other across , and we may want to swap their order. The move shown in [7, Fig. 1.19] allows us to rotate mandibles past each other in such a configuration, but we will not require such a move in this paper.

Note that we do not want to rotate one mandible to close onto the other mandible of a single bird beak, as this would result in a degree one edge where the beak is folded over onto itself.

###### Lemma 4.3.

Assume that we have a triangulation with a bird beak, and that collapsing the bird beak via a 2-0 move would not result in a triangulation with a degree one edge. Then we can perform the move of rotating the bird beak past a tetrahedron that is not one of the two tetrahedra of the bird beak, by performing a 2-3 followed by a 3-2 move, neither of which introduce a degree one edge, unless this move results in a bird beak folded over onto itself.

###### Proof.

See Figure 12. The faces marked have degree at least two, since otherwise we have a bird beak folded over onto itself. All other faces in the sequence above have degree at least two, either by directly counting vertices in the diagram, or because the corresponding face after performing the 2-0 move has degree at least two, by assumption. ∎

If we start with a triangulation with no degree one edges and then perform a V-move, this lemma allows us to rotate the mandibles of the resulting bird beak to any position we wish without introducing any degree one edges, as long as we move the mandibles of the beak through a part of the book of tetrahedra for which all tetrahedra are distinct (to avoid the issues discussed in Remark 4.2), and we do not close the beak onto itself.

### 4.4. Inserting a triangular pillow

We have our triangulation , which has a triangle , with incident edge which is degree two, and which in becomes degree one. Let the other two edges of be called and , and suppose that the two tetrahedra incident to are also glued along the edges and . See Figure 13.

Our plan is to use two V-moves, on tetrahedra incident to each of and , to introduce bird beaks that split the books of tetrahedra around and . We then use Lemma 4.3 to rotate the mandibles of the two beaks around until they form our triangular pillow. In order to apply Lemma 4.1 and so apply the V-move, splitting the book of tetrahedra around say, we need to find a triangle incident to , all of whose edges are degree at least three. In particular, we require that has degree at least three – we first check that this is the case.

Suppose not, and assume that has degree two. Then considering Figure 13, we see that the triangulation would have a vertex with spherical link, with only the two tetrahedra incident to incident to it. But there must then be another vertex of the triangulation, since not all vertices of the two tetrahedra are at . In the closed case this contradicts the assumption in Theorem 1.1 that the triangulation has only a single vertex. In the case that has boundary, the spherical link of gives another contradiction, since we assume that has no spherical boundary components.

So we know that has degree at least three, as do and by the same argument. Next, we need to find a triangle incident to , all of whose edges have degree at least three. Consider Figure 13 again. We know that the edge has degree at least three. If the edge also has degree at least three then we are done: we have found a triangle incident to with three edges of degree at least three. If not, then must have degree two (since there are no degree one edges), and is incident to another tetrahedron, , say, which is incident to and one other edge, say , which is opposite in . The tetrahedron has two triangles that are incident to , one of which we have already checked, and the other, which has edges and . We saw above that has degree at least three, and so if also has degree three, then we are again done. If not, then again must have degree two, and we continue with another tetrahedron incident to and one other edge, say , which is opposite in the new tetrahedron.

We continue in this fashion, building a stack of tetrahedra, until we either find a triangle incident to and two other edges of degree at least three, or the stack wraps around to join onto the back side of the two tetrahedra we started with, and with the final degree two edge being the edge opposite in the back tetrahedron shown in Figure 13. Note that this is the only way in which the stack of tetrahedra can glue to itself.

Since the manifold is orientable, there are four cases to consider, depending on the angle by which the front of the stack of tetrahedra we have built is glued onto the back.

• If the stack is glued with no rotation (and so there must be an even number of tetrahedra in the stack), then the four vertices of the tetrahedra are distinct after gluing with spherical vertex links, which again contradicts the hypotheses given in Theorem 1.1.

• If the stack is glued with a half-turn rotation (and so again there must be an even number of tetrahedra in the stack), then there are two distinct vertices after gluing, each with spherical vertex links, and again we contradict the hypotheses given in Theorem 1.1.

• If the stack is glued with either a quarter turn or a three quarters turn, then we have a single-vertex triangulation of the manifold L(4,1), which is the exception listed in Theorem 1.1.

###### Remark 4.4.

The above argument constructs the triangulations of L(4,1) mentioned in the introduction. Each is formed from a stack of an odd number of tetrahedra, with degree two edges between each pair of tetrahedra in the stack. The two triangles at the top of the stack are glued to the two triangles at the bottom of the stack, with a quarter (or equivalently, three-quarter) turn. No edge has degree three, so no 3-2 move is possible. Moreover, every possible 2-3 move introduces a degree one edge.

So, we find a triangle incident to for which all edges have degree at least three. Then using Lemma 4.1, we perform a V-move that results in a bird beak that splits apart the book of tetrahedra around . Figure (a)a shows the result in the case that the edge has degree at least three – we get a bird beak wrapped around one of the two tetrahedra incident to . Otherwise, we obtain a bird beak wrapped around a tetrahedron somewhere further up the stack. By using Lemma 4.3, we can rotate the mandibles of such a beak one by one down the stack (noting that all tetrahedra of the stack are distinct), until it is in the position shown in Figure (a)a. By moving the lower mandible before the upper one, we can ensure that we do not close the bird beak onto itself when rotating its mandibles, which would produce a degree one edge.

Next, we need to add the other bird beak needed to make our triangular pillow. As before, we know that edges and have degree at least three, and after our previous moves, now has degree at least three as well. So we can apply Lemma 4.1 here, splitting apart the book of tetrahedra around and obtaining Figure (b)b. Finally, using Lemma 4.3, we close the two bird beaks around each others mandibles, producing our triangular pillow. See Figure 15.

To summarise, in this section we described a procedure to introduce a triangular pillow without introducing a degree one edge at any stage. This then completes the proof of Theorem 1.1.

## References

• [1] Blake Dadd and Aochen Duan, Constructing infinitely many geometric triangulations of the figure eight knot complement, Proc. Amer. Math. Soc. (2016), published electronically, http://arxiv.org/abs/1508.04942.
• [2] Tudor Dimofte, Davide Gaiotto, and Sergei Gukov, 3-manifolds and 3d indices, Adv. Theor. Math. Phys. 17 (2013), no. 5, 975–1076, http://arxiv.org/abs/1112.5179.
• [3] by same author, Gauge theories labelled by three-manifolds, Comm. Math. Phys. 325 (2014), no. 2, 367–419, http://arxiv.org/abs/1108.4389.
• [4] Tudor Dimofte and Stavros Garoufalidis, The quantum content of the gluing equations, Geometry & Topology 17 (2013), 1253–1315.
• [5] Stavros Garoufalidis, Craig D. Hodgson, J. Hyam Rubinstein, and Henry Segerman, 1-efficient triangulations and the index of a cusped hyperbolic 3-manifold, Geometry & Topology 19 (2015), 2619–2689.
• [6] Sergei Matveev, Transformations of special spines, and the Zeeman conjecture, Izv. Akad. Nauk SSSR Ser. Mat. 51 (1987), no. 5, 1104–1116, 1119.
• [7] by same author, Algorithmic topology and classification of 3-manifolds, second ed., Springer, 2007.
• [8] Riccardo Piergallini, Standard moves for standard polyhedra and spines, Rend. Circ. Mat. Palermo (2) Suppl., no. 18, Third National Conference on Topology (Italian), 1988, pp. 391–414.
• [9] Stavros Garoufalidis, with an appendix by Sander Zwegers, The 3D index of an ideal triangulation and index structures, http://arxiv.org/abs/1208.1663.
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters