Skip to main content
Proceedings of the National Academy of Sciences of the United States of America logoLink to Proceedings of the National Academy of Sciences of the United States of America
. 2004 Dec 2;101(50):17357–17360. doi: 10.1073/pnas.0406098101

Unexpected connections between Burnside groups and knot theory

Mieczyslaw K Dabkowski , Józef H Przytycki ‡,§
PMCID: PMC536021  PMID: 15576510

Abstract

In classical knot theory and the theory of quantum invariants substantial effort was directed toward the search for unknotting moves on links. We solve, in this article, several classical problems concerning unknotting moves. Our approach uses a concept, Burnside groups of links, that establishes an unexpected relationship between knot theory and group theory. Our method has the potential to be used in computational biology in the analysis of DNA via tangle embedding theory, as developed by D. W. Sumners [Sumners, D. W., ed. (1992) New Scientific Applications of Geometry and Topology (Am Math. Soc., Washington, DC) and Ernst, C. & Sumners, D. W. (1999) Math. Proc. Cambridge Philos. Soc. 126, 23–36].


Connections between knot theory and group theory can be traced back to Listing's pioneering paper of 1847 (1), in which he considered knots and groups of signed permutations. The first well established instance of such a connection was provided by M. Dehn (2). He applied the Poincaré's fundamental group of a knot exterior to study knots and their symmetries. The connection we describe in this article is, on the one hand, deeply rooted in Poincaré's tradition, and, on the other hand, it is unexpected. It was discovered in our study of the cubic skein modules of the three-sphere and led us to the solution of the 20-year-old Montesinos–Nakanishi conjecture.

We outline our main ideas and proofs. The complete exposition of this theory and its applications will be the subject of a future article.

Open Problems

Every link can be simplified to a trivial link by crossing changes (Fig. 1). This observation led to many significant developments, in particular, the construction of the Jones polynomial of links and the Reshetikhin–Turaev invariants of three-manifolds. These invariants had a great impact on modern knot theory. The natural generalization of a crossing change, which is addressed in this article, is a tangle replacement move, that is, a local modification of a link, L, in which a tangle T1 is replaced by a tangle T2. Several questions have been asked about which families of tangle moves are unknotting operations.

Fig. 1.

Fig. 1.

Crossing changes.

One such family of moves, which is significant not only in knot theory but also in computational biology, is the family of rational moves (3). In this paper we devote our attention to special classical cases (20):

  1. Nakanishi four-move conjecture, 1979. Every knot is four-move equivalent to the trivial knot.

  2. Montesinos–Nakanishi three-move conjecture, 1981. Every link is three-move equivalent to a trivial link.

  3. Kawauchi's question, 1985. Are link-homotopic links four-move equivalent?

  4. Harikae–Nakanishi conjecture, 1992. Every link is (two, two)-move equivalent to a trivial link.

  5. (Two, three)-move question, 1995. Is every link (two, three)-move equivalent to a trivial link?

    The method of Burnside groups, which we introduce, allows us to answer questions iiv, although conjecture i remains open. We generalize questions ii, iv, and v to the following question:

  6. Rational moves question. Is it possible to reduce every link to a trivial link by rational Inline graphic-moves where p is a fixed prime and q is an arbitrary nonzero integer? See Definition 1.1.

To approach our problems, we define invariants of links and call them the Burnside groups of links. These invariants are shown to be unchanged by Inline graphic-rational moves. The strength of our method lies in the fact that we are able to use the well developed theory of classical Burnside groups and their associated Lie rings (4). We first describe, in more detail, how our method is applied to rational moves. In particular, we settle the Montesinos–Nakanishi and Harikae–Nakanishi conjectures. Later, we answer Kawauchi's question in detail.

Definition 1.1: A rational Inline graphic-moverefers to changing a link by replacing an identity tangle in it by a rational Inline graphic-tangle of Conway (Fig. 2a).

Fig. 2.

Fig. 2.

Representation of Definition 1.1. (a) Rational move. (b and c) Odd (b) and even (c) rational tangles.

The tangles shown in Fig. 2b are called rational tangles and denoted by T(a1, a2,...,an) in Conway's notation. A rational tangle is the Inline graphic-tangle if Inline graphic. Conway proved that two rational tangles are ambient isotopic (with boundary fixed) if and only if their slopes are equal (compare ref. 6).

Rational tangles can also be viewed as tangles, which are obtained by applying a finite number of consecutive twists of the neighboring endpoints to the elementary tangle (zero tangle).

Rational Inline graphic-tangles were used by Sumners and Ernst (7) in their mathematical model of DNA recombination. This is a very promising development in computational biology.

The following definition establishes a connection between two classical theories, knot theory and the theory of Burnside groups. Burnside groups of a link play a crucial role in our research and they can contribute significantly to the applications of knot theory in computational biology.

Definition 1.2: Let D be a diagram of a link L. We define the associated core group Inline graphic of D by the following presentation: generators of Inline graphic correspond to arcs of the diagram. Any crossing vs yields the relation Inline graphic, where yi corresponds to the overcrossing and yj, yk correspond to the undercrossings at vs (see Fig. 3).

Fig. 3.

Fig. 3.

Wirtinger's relation.

Remark 1: In the above presentation of Inline graphic one relation may be dropped since it is a consequence of others.

Definition 1.3: (i) The nth Burnside group of a link is the quotient of the fundamental group of the double-branched cover of S3 with the link as the branch set by its subgroup that is generated by all relations of the form wn = 1. Succinctly: Inline graphic.

(ii) The unreduced nth Burnside group of the unoriented link L is the quotient group Inline graphic, where Inline graphic is the associated core group of L.

The relation to the fundamental group of a double-branched cover, mentioned above, is formulated below. An elementary proof using only Wirtinger presentation and also valid for tangles is presented in ref. 12.

Theorem 1.1 (Wada). If D is a diagram of a link (or a tangle) L, then Inline graphic. Furthermore, if we put yi = 1 for any fixed generator, then Inline graphic reduces to Inline graphic.

The next theorem allows us to use Burnside groups to analyze elementary moves on links.

Theorem 1.2. The groups BL(n) and B̂L(n) are preserved by rational Inline graphic-moves. In particular, the nth Burnside group is preserved by n-moves.

Proof: Let L′ be obtained from L by a Inline graphic-move. Then Inline graphic is obtained from Inline graphic by performing the Inline graphic-surgery. Such a surgery can be easily proved to preserve the nth Burnside group of the fundamental group of the manifold.

Reductions by Rational Moves

We show that the answer to the rational move question, problem (vi), is negative.

Theorem 2. (i) The closure, Inline graphic, of the three-braid Inline graphic (Fig. 4a) is not Inline graphic-move reducible to a trivial link for any prime number p ≥ 5.

Fig. 4.

Fig. 4.

Braids representing two full twists. (a) Three-braid. (b) Five-braid.

(ii) The closure of the five-braid Inline graphic (Fig. 4b) is not three-move reducible to a trivial link.

Sketch of the Proof: We use Sanov's theorem about the structure of the Lie algebra associated to the Burnside group of prime exponent p ≥ 5 (13, 14). For p = 3 we observe that the third Burnside group Inline graphic is the quotient of the free Burnside group, B(4, 3), by the normal subgroup generated by relations Inline graphic, where the words Qi can be computed from Fig. 4b by using the core relations (Fig. 3).†† To see that relations are nontrivial in the free Burnside group, we use the theorem of Levi and van der Waerden about the structure of the associated Lie rings of Burnside groups of exponent 3 (16).

The closed braid Inline graphic is three-move equivalent to a link of 20 crossings [closure of the five-string braid Inline graphic]. It is still an open problem whether the Montesinos–Nakanishi conjecture holds for links up to 19 crossings. Q. Chen proved that it holds for links up to 12 crossings (17).

The negative answers to problems ii, iii, and v follow from the theorem for p = 3, 5, and 7, respectively (see ref. 18 for details).

Kawauchi's Question on Four-Moves

Here, we use the fourth Burnside group of links to show that there is an obstruction to four-move reducibility of links that are link homotopically trivial. Therefore, the answer to Kawauchi's question is negative.

Let w denote the “half” two-cabling of the Whitehead link, which is the link homotopy equivalent to the trivial link of three components (Fig. 5a).

Fig. 5.

Fig. 5.

Half two-cabling of the Whitehead link and its two-tangle presentation. (a) The diagram of w.(b) Computation of relations of Bw(4).

Theorem 3. The link w is not four-move equivalent to a trivial link.

Our proof uses the obstruction in the Burnside group B(2, 4). The obstruction lies in the last nontrivial term of the lower central series, γ5, of B(2, 4) or equivalently in the fifth term of the associated graded Lie ring of B(2, 4). In fact, we have:

Lemma. Bw(4) = B(2, 4)/γ5.

Sketch of the Proof: The lower central series of B(2, 4) is known to be of class 5, with the last term γ5 = L5 isomorphic to Z2Z2 (14). First, we compute Inline graphic by using a presentation of the associated core group of w by putting the generator z = 1. From the diagram we obtain the relations: Q1x–1 and Q2y–1 (Fig. 5b), and further the equivalent relations

graphic file with name M32.gif

Therefore Inline graphic

In Bw(4) this relations can be reduced into:

graphic file with name M34.gif

Analogously, R2 = [y, x, y, x, y] ∈ γ5.

Those elements form a basis of γ5 = Z2Z2 considered as a Z2 linear space. We verified this fact by using the programs gap, magnus, and magma. These calculations can be done manually; however, they strongly depend on the unpublished Ph.D. thesis of J. J. Tobin (19), as it was pointed out to us by M. Vaughan-Lee (University of Oxford, Oxford).

It follows from the above Lemma, and the fact that γ5 is in the center of B(2, 4), that |Bw(4)| = 210. On the other hand, the abelianization of Bw(4) is isomorphic to Z4Z4. So if w were four-reducible into a trivial link then the trivial link would have three components. But BT3(4) = B(2, 4) has 212 elements, as predicted by Burnside (8) and verified by Tobin (19). This completes the proof.

Remark 2: Nakanishi showed, using Alexander modules, that the Borromean rings, BR, cannot be reduced to a trivial link by four-moves. Our Burnside obstruction method also works in this case. Knowing that |B(2, 4)| = 212 we can verify that |BBR(4)| = 25. In addition, we conclude that w and BR are not four-move equivalent.

By Coxeter's theorem (21) the quotient group Inline graphic is finite. Therefore, for closed three-braids, we can list all possible fourth Burnside groups. This allows us to find all four-move equivalence classes of closed three-braids (unpublished work).

Limitations of the Burnside Group Invariant

The method based on the Burnside group invariant has been quite successful in the study of the unknotting property of several classes of tangle replacement moves. As we saw earlier, for any fixed prime number p ≥ 3 and an arbitrary nonzero integer q, rational Inline graphic-moves are not unknotting operations. However, our method has its limitations. We have been unable to find, by our method, obstructions for Inline graphic-reduction of a link L to a trivial link if the abelianization of the nth Burnside group of the link, Inline graphic, is a cyclic group (i.e., {1} or Zn). This is explained in Theorem 4.

Define the restricted Burnside group of a link, RL(n), as the quotient group BL(n)/N, where N is the intersection of all normal subgroups of BL(n) of finite indexes.

Theorem 4. Let n be a power of a prime number. Assume that the abelianization of BL(n) is a cyclic group. Then the restricted Burnside group, RL(n), is isomorphic to Inline graphic. In particular, if BL(n) is finite (e.g., for n = 2, 3, 4), then BL(n) is a cyclic group.

Proof: It was proved by E. Zelmanov (14) that R(r, n) is finite for any n. It follows that RL(n) is finite for any n.

Let γ1 ≥ γ2 ≥ ··· ≥ γi ≥ ··· be the lower central series of BL(n). If (BL(n))(ab) [and therefore also (RL(n))(ab)] is a cyclic group then γ2 = γ3 = γ4.... Since RL(n) is a finite nilpotent group, therefore RL(n) = (BL(n))(ab).

If BL(n) is finite (as it is in the case of n = 2, 3, 4), then RL(n) = BL(n), so BL(n) is a cyclic group.

Therefore, the method based on the Burnside group invariant will not produce any obstructions for the Nakanishi four-move conjecture and the Kawauchi four-move question for a link of two components.

Conclusion

Our interest in the analysis of rational moves on links was inspired by our long pursuit of a program for understanding a 3D manifold by the knot theory that it supports. The method we introduced, the Burnside group of links, not only settles classical conjectures (e.g., the Montesinos–Nakanishi conjecture) but also has clear potential to be used in computational biology in an analysis of DNA, its recombination, action of topoisomers, and analysis of protein folding and protein evolution.

Author contributions: M.K.D. and J.H.P. wrote the paper.

Footnotes

This move was first considered by J. M. Montesinos (5).

These groups were first considered by W. Burnside in 1902 (8), when he asked when the group, in modern notation B(r, n), is finite. Here B(r, n) is the quotient group of the free group on r generators modulo the subgroup generated by all words of the form wn. It was shown that B(r, n) is finite for n = 2, 3, 4, 6. On the other hand, Novikov and Adjan (911) proved that B(r, n) is infinite for r ≥ 2 and n odd and sufficiently large. It is an open problem whether the group B(2, 5) is infinite, as most of experts predict, or finite, in which case it would have 534 elements.

††

One gets Inline graphic(see ref. 15).

References

  • 1.Listing, J. B. (1847) Vorstudien Topologie 1, 811–875. [Google Scholar]
  • 2.Dehn, M. (1910) Math. Annalen 69, 137–168. [Google Scholar]
  • 3.Sumners, D. W., ed. (1992) New Scientific Applications of Geometry and Topology (Am. Math. Soc., Washington, DC).
  • 4.Magnus, W. (1935) Math. Ann. 111, 259–280. [Google Scholar]
  • 5.Montesinos, J. M. (1973) Bol. Soc. Mat. Mexicana 18, 1–32. [Google Scholar]
  • 6.Kawauchi, A. (1996) A Survey of Knot Theory (Birkhausen, Basel).
  • 7.Ernst, C. & Sumners, D. W. (1999) Math. Proc. Cambridge Philos. Soc. 126, 23–36. [Google Scholar]
  • 8.Burnside, W. (1902) Q. J. Pure Appl. Math. 33, 230–238. [Google Scholar]
  • 9.Novikov, P. S. & Adjan, S. I. (1968) Izv. Akad. Nauk SSSR Ser. Mat. 32, 212–244. [Google Scholar]
  • 10.Novikov, P. S. & Adjan, S. I. (1968) Izv. Akad. Nauk SSSR Ser. Mat. 32, 251–524. [Google Scholar]
  • 11.Novikov, P. S. & Adjan, S. I. (1968) Izv. Akad. Nauk SSSR Ser. Mat. 32, 709–731. [Google Scholar]
  • 12.Przytycki, J. H. (1998) Banach Center Publ. 42, 275–295. [Google Scholar]
  • 13.Sanov, I. N. (1952) Izv. Acad. Nauk SSSR Ser. Mat. 16, 23–58. [Google Scholar]
  • 14.Vaughan-Lee, M. (1993) The Restricted Burnside Problem (Oxford Univ. Press, New York).
  • 15.Da̧bkowski, M. K. & Przytycki, J. H. (2002) Topol. Geometry 6, 335–360. [Google Scholar]
  • 16.Levi, F. & var der Waerden, B. L. (1933) Abh Math. Sem. Univ. Hamburg 9, 154–158. [Google Scholar]
  • 17.Chen, Q. (2000) Knots Everything 24, 36–47. [Google Scholar]
  • 18.Da̧bkowski, M. (2003) Ph.D. thesis (George Washington Univ., Washington, DC).
  • 19.Tobin, J. J. (1954) Ph.D. thesis (Univ. of Manchester, Manchester, U.K.).
  • 20.Kirby, R. (1997) in Problems in Low-Dimensional Topology: Geometric Topology, Proceedings of the Georgia International Topology Conference 1993, Studies in Advanced Mathematics, ed. Kazez, W. (Am. Math. Soc., Washington, DC), Vol. 2, Part 2, pp. 35–473. [Google Scholar]
  • 21.Coxeter, H. S. M. (1959) in Proceedings of the Fourth Canadian Mathematical Congress (Univ. of Toronto Press, Toronto), pp. 95–122.

Articles from Proceedings of the National Academy of Sciences of the United States of America are provided here courtesy of National Academy of Sciences

RESOURCES