Preprint
Article

Tangles with k Ropes and 2k Hands

Altmetrics

Downloads

81

Views

59

Comments

0

This version is not peer-reviewed

Submitted:

03 December 2023

Posted:

04 December 2023

You are already at the latest version

Alerts
Abstract
This paper will explore analogs of groups formed by the transformations of two ropes as presented by Minh-Tam Quang Trinh.1 The two operations acting on these ropes are T and S, defined as twists and clockwise turns, respectively. These actions intertwine the ropes, creating tangles. T and S also have the ability to untangle the rope when used in certain combinations. In the two-rope case, these actions expressed as a group presentation were shown to be isomorphic to SL2(Z). We explored the analog of these opera- tions, T and S, and conjectured the corresponding group to which they are isomorphic. Partial proofs for this conjecture are included and future work would include proving our conjecture as well as generalizing results to k ropes.
Keywords: 
Subject: Computer Science and Mathematics  -   Algebra and Number Theory

1. Introduction

1.1. Background2

Intertwined ropes are referred to as tangles, and each of their ends as hands. Our research is an extension of the ideas presented by Minh-Tam Quang Trinh, which comes from the last section of John Conway’s paper, “Tangles."
There are two operations that have the ability to “increase or decrease the amount of ‘tangling’ that the ropes exhibit." We define T as the twisting of the two rightmost hands. We also define S to be the counterclockwise rotation of all the hands by 180 k .
A "nontangle" is defined as none of the ropes intersecting each other. When starting with a nontangle, there arises an interesting connection between the tangles and the rational numbers for which we will consider the group:
Γ ˜ = S L 2 ( Z ) : = a b c d a , b , c , d Z s . t . a d b c = 1 .
Let I be the identity matrix, and
Γ = P S L 2 ( Z ) : = Γ ˜ / ± I ,
where we identify γ = a b c d with γ : = a b c d . If z is an element of Q { } , then Γ ˜ acts on the set Q { } by fractional linear transformations such that
a b c d · z = a z + b c z + d .
This defines a Γ ˜ action on Q { } :
I · z = z and γ · ( γ · z ) = γ γ · z for all γ , γ Γ ˜
Let T ˜ and S ˜ be special elements in Γ ˜ :
T ˜ = 1 1 0 1 and S ˜ = 0 1 1 0 .
Notice T ˜ · z = z + 1 and S ˜ · z = 1 / z , so indeed, there is a clear analogy between the twist and turn operations acting on the ropes and the matrices in S L 2 ( Z ) acting on rational numbers.

1.2. Our Objective

We aim to find the analogues of the groups Γ and Γ ˜ where there are three ropes and six hands. Further directions would be the general construction of groups and group actions for the general k ropes and 2 k hands case.

2. Finding 3-Rope Analogs for Γ and Γ ˜

2.1. Group Presentation

In the 2-rope case, Γ and Γ ˜ have presentations in terms of two specific two-dimensional matrices with determinant 1, T ˜ and S ˜ :
Γ ˜ T ˜ , S ˜ | S ˜ 2 = ( T ˜ S ˜ ) 3 = J
where J is central and J 2 = I , and
Γ T , S | S 2 = ( T S ) 3 = I
where T and S are the respective images of T ˜ and S ˜ in Γ .
Our first goal was to find analogs of these presentations in the three-rope case. Through manual experimentation, we found that rotating by 60° (or S) six times brought us back to the original configuration, while 30 repetitions of the two rightmost ropes twisting, followed by a 60° rotation (or T S ), did the same thing.
We then determined the relationship between J and I in our presentation of the analog of Γ . In the two rope case, J 2 = I . This was due to J representing a 180° rotation as J = I and Γ = P S L ( 2 , Z ) : = Γ ˜ / ± I . This can be thought of as treating the ropes as indistinct. In our case, this would be equivalent to a rotation of 120°, where J 3 = I .
Using these relationships our new presentations are:
Γ ˜ T ˜ , S ˜ | S ˜ 2 = ( T ˜ S ˜ ) 10 = J
where J is central and J 3 = I , and
Γ T , S | S 2 = ( T S ) 10 = I
for matrices T ˜ and S ˜ in Γ ˜ and their respective images, T and S, in Γ .

2.2. Finding S

We would like to find an analogous matrix S to the two-dimensional matrix that satisfies the properties of our group presentation, i.e. S 6 = I . To narrow down our search, we took inspiration from the fact that the two-rope scenario could be represented by S L 2 ( Z ) and supposed that S S L 3 ( Z ) . This means that S is a 3 × 3 matrix that acts on the three-dimensional vectors. However, since S has order 6, it would be difficult to visualize if we worked with S directly. Hence, we decided to first find a matrix M such that M 3 = I , and from there, all we need to do is take the negative of M and we get our desired S since S 3 would equal I .
Now that we’ve reduced it down to an exponent of 3, we can visualize M as a matrix that “rotates" the entries of a vector x y z :
Preprints 92123 i001
In other words, multiplying by M once gives us x y , y z , z x . Notice that this indeed satisfies M 3 = I because performing three such rotations returns the vector back to its original state. To solve for M, let M = a b c d e f g h i . Then,
M · x y z = a x + b y + c z d x + e y + f z g x + h y + i z = z x y ,
which gives us the following system of equations:
a x + b y + c z = z , d x + e y + f z = x , g x + h y + i z = y .
These equations must be satisfied for all x , y , z Z , so if we plug in ( x , y , z ) = ( 1 , 0 , 0 ) , we get that a = 0 , d = 1 , and g = 0 . Similarly, plugging in ( 0 , 1 , 0 ) and ( 0 , 0 , 1 ) yields b = 0 , e = 0 , h = 1 and c = 1 , f = 0 , i = 0 , so
M = 0 0 1 1 0 0 0 1 0 ,
and
S = M = 0 0 1 1 0 0 0 1 0 .
A quick calculation indeed verifies that S 6 = I .

2.3. Finding T S and T

Having found S, our next step is to find a T that satisfies the property ( T S ) 30 = I . We can first solve for T S and then multiply by the inverse of S, which exists because det ( S ) 0 , giving us T. However, due to the size of the exponent of T S , we couldn’t solve for it directly. We instead considered an alternative approach.

2.3.1. A Simplified Case

In our attempts to find another method, we explored various cases, including starting with something other than non-tangles. In particular, we looked at the following starting configuration where the ends of each rope are diametrically opposite:
Preprints 92123 i002
Here, we let S be a 60 clockwise rotation and T be the swapping of the two rightmost points (Z and Y in the figure above). Through physical experimentation using shoelaces, we found that, using this configuration, we are able to return back to the original state with just five iterations of T S , i.e. ( T S ) 5 = I .
In our search for S, we considered it from the perspective of rotations and cycling the three entries of the vector. Along a similar vein, we attempted to represent what was happening with T S as a rotation matrix of the 3 dimensional space. We let T S model a rotation of a plane in R 3 by 360 5 = 72 .
WLOG, suppose the plane that we are rotating is the x y -plane. The rotation matrix of the x y -plane by 72 is
R = cos 72 sin 72 0 sin 72 cos 72 0 0 0 1 ,
and we can verify that indeed, R 5 = I . After setting T S = R , we have found a T S satisfying the property we observed.

2.3.2. Extending to Our Case

We can extend our findings from the simplified case to our original case where the three ropes start off in a nontangle:
Preprints 92123 i003
We found that ( T S ) 30 = I , meaning we return to the original positioning after 30 iterations of T S . It follows that we can model T S as a rotation of the x y -plane by 360 30 = 12 .
By modifying the angle values of the entries of R in the previous section, we get
T S = cos 12 sin 12 0 sin 12 cos 12 0 0 0 1 .
Next, we aim to solve for T. We do this by multiplying T S by the inverse of S. We have
S 1 = S 5 = 0 1 0 0 0 1 1 0 0 ,
which implies
T = ( T S ) S 1 = cos 12 sin 12 0 sin 12 cos 12 0 0 0 1 0 1 0 0 0 1 1 0 0 = 0 cos 12 sin 12 0 sin 12 cos 12 1 0 0 .
In conclusion, we have
S = 0 0 1 1 0 0 0 1 0 , T = 0 cos 12 sin 12 0 sin 12 cos 12 1 0 0 .

2.4. Analog of S L 2 ( Z )

In the two-rope scenario, it turned out that all the actions lay within S L 2 ( Z ) since all entries of T and S were integers. We can easily see that such argument fails in our three-rope case, because the entries of our matrix for T are not all integers. This implies that we cannot simply use S L 3 ( Z ) as the analog to Γ .
Hoping to at least preserve a similar structure as S L 2 ( Z ) , we tried to see if a group of the form S L 3 ( Z [ α ] ) for some real α would work. Based on the entries of our T, we would need cos 12 , sin 12 S L 3 ( Z [ α ] ) .
We claim that if we let α = ζ 60 + ζ 60 ¯ 2 , where ζ 60 is the 60th root of unity, the above condition is satisfied. To show this, first note that cos 12 and sin 12 are the real and imaginary parts of the 30th root of unity, respectively, so we can write cos 12 = ζ 30 + ζ 30 ¯ 2 and sin 12 = ζ 30 ζ 30 ¯ 2 i .
From "On the Ring of Integers of Real Cyclotomic Fields",3 we know that Z [ ζ n + ζ n ¯ ] is the ring of integers of the nth real cyclotomic field, i.e. if a real number r can be expressed using only powers of ζ n and constants, then r Z [ ζ n + ζ n ¯ ] . We know that cos 12 and sin 12 are real numbers. Furthermore, ζ 30 = ( ζ 60 ) 2 , ζ 30 ¯ = ( ζ 60 ) 2 , and i = ( ζ 60 ) 15 , so both cos 12 and sin 12 can be expressed using powers of ζ 60 . Therefore, cos 12 , sin 12 Z [ ζ 60 + ζ 60 ¯ 2 ] , as desired. Hence, our desired analog of S L 2 ( Z ) is S L 3 ( Z [ ζ 60 + ζ 60 ¯ 2 ] ) .

2.5. Showing Isomorphism

We want to show there is an isomorphism between S L 3 Z ζ 30 + ζ 30 ¯ 2 and our presentation T ˜ , S ˜ S ˜ 2 = ( T ˜ S ˜ ) 10 = J . We can do this with a theorem from Jean-Pierre Serre’s “Trees,”4 which states the following:
Theorem 1.
Let G be a group acting on a graph Γ. Let T a segment in Γ be a fundamental domain for Γ mod G. Let P, Q be the vertices of T and e = { y , y ¯ } be the geometric edge of T. Let G P , G Q and G y = G y ¯ be the stabilizers of P, Q and y respectively. Then the following are equivalent:
  • Γ is a tree
  • The canonical homomorphism
    G stab ( U ) stab ( e ) stab ( W )
     is an isomorphism.
Hence, if we can find a fundamental domain constructed by two points whose stabilizers are the powers of S and T S respectively and show that S L 3 ( Z [ α ] ) acts on the tree with this fundamental domain, then we have shown our desired isomorphism. We first need to find the two points stabilized by powers of S and T S . Let the point stabilized by powers of S be U = x 1 y 1 z 1 and the point stabilized by powers of T S be W = x 2 y 2 z 2 . For U, we have
S U = U 0 0 1 1 0 0 0 1 0 x 1 y 1 z 1 = x 1 y 1 z 1 .
This gives us the equations z 1 = x 1 , x 1 = y 1 , and y 1 = z 1 , which simplifies to x 1 = y 1 = z 1 . We only care about the ratio of the coordinates, so we can let x 1 = y 1 = z 1 = 1 , meaning that the point stabilized by S is U = 1 1 1 .
It’s easy to verify that U is indeed stabilized by S , S 2 , , S 6 . However, we need to show that these are the only matrices in S L 3 ( Z [ α ] ) that stabilize U.
Suppose that M = a b c d e f g h i S L 3 ( Z [ α ] ) stabilizes U, i.e.
a b c d e f g h i 1 1 1 = β β β
where β is an eigenvalue of M. Since M 6 = I , we have β 6 = 1 , so β is a 6th root of unity. Furthermore, β must be real because the entries of M are all real, so β = ± 1 . WLOG, suppose β = 1 , so
a b c d e f g h i 1 1 1 = 1 1 1 .
Now, consider the following theorem:
Theorem 2.
If a matrix M satisfies M n = I and M x y z = x y z , i.e. M is a stabilizer of x y z , then M rotates the plane perpendicular to x y z by some multiple of 360 n .
The proof of this theorem uses the fact that any vector parallel to the axis of rotation is unaffected by the rotation. So, assuming that M I , the only way for M to keep x y z unchanged is if x y z is parallel to the axis of rotation, or it is perpendicular to the plane rotated by M. Furthermore, because M n = I , the plane needs to be returned to its original state after n applications of M, so the only possible angles that the plane can be rotated by under M are multiples of 360 n . In our case, M 6 = I and M 1 1 1 = 1 1 1 , so any stabilizer of U rotates the plane perpendicular to 1 1 1 by some multiple of 60 . There are only 6 multiples of 60 , so there are only 6 possible M that stabilize U. However, we already know that the six powers of S stabilize U, so S , S 2 , , S 6 must be the only stabilizers of U. (The same reasoning applies if we had β = 1 instead of β = 1 . For W, we have
( T S ) W = W cos 12 sin 12 0 sin 12 cos 12 0 0 0 1 x 2 y 2 z 2 = x 2 y 2 z 2 .
This gives us the equations
x 2 cos 12 + y 2 sin 12 = x 2 ,
x 2 sin 12 y 2 cos 12 = y 2 ,
z 2 = z 2 .
The last equation is redundant, but the first two give us x 2 = cos 12 + 1 and y 2 = sin 12 . So, suppose we let W = cos 12 + 1 sin 12 1 . Now, we want to show that the powers of T S , i.e. T S , ( T S ) 2 , , ( T S ) 30 , are the only stabilizers of W. Using Theorem 2.2, we know that any matrix satisfying M 30 = I and M cos 12 + 1 sin 12 1 = cos 12 + 1 sin 12 1 rotates the plane perpendicular to cos 12 + 1 sin 12 1 by some multiple of 360 30 = 12 . There are only 30 multiples of 12 , so W only has 30 stabilizers. Since we know all 30 powers of T S stabilize W, this implies that they are the only stabilizers of W. With this, we have shown that the edge connecting U and W, call it L, is indeed a fundamental domain with the desired properties.
From Theorem 2.1 , we can prove the isomorphism if we show that the graph generated by the matrices in S L 3 ( Z [ α ] ) on L is a tree. (A tree is a connected graph without cycles.) We want to show that the graph generated by applying combinations of S and T S to L is a tree by using the following conjecture: the identity can only be constructed with combinations of S 6 and ( T S ) 30 . This remark is useful because a cycle in the graph only exists when there exists some non-trivial combination of S and T S that evaluates to the identity.
For the sake of clarity, we denote T S as N. Consider the basic strings consisting of S and N: (Note that we only consider powers of S up to 5 and powers of N up to 29, as S 6 = N 30 = I )
N k = cos ( 12 k ) sin ( 12 k ) 0 sin ( 12 k ) cos ( 12 k ) 0 0 0 1 S 2 N k = sin ( 12 k ) cos ( 12 k ) 0 0 0 1 cos ( 12 k ) sin ( 12 k ) 0 S 4 N k = 0 0 1 cos ( 12 k ) sin ( 12 k ) 0 sin ( 12 k ) cos ( 12 k ) 0 N k S 2 = 0 cos ( 12 k ) sin ( 12 k ) 0 sin ( 12 k ) cos ( 12 k ) 1 0 0 N k S 4 = sin ( 12 k ) 0 cos ( 12 k ) cos ( 12 k ) 0 sin ( 12 k ) 0 1 0
Because S 3 = I , we consider only the strings with even powers of S, since those with odd powers of S can be rewritten as -1 times an even power of S. Observe that left-multiplying by powers of S effectively cycles the rows of N k , whereas right-multiplying by S cycles the columns. This means that for any string of the form S h M k , we can always find some power of S, say n, such that S h M k S n reduces to the form of one of the three rotation matrices in 3D space below:
R x ( θ ) = 1 0 0 0 cos θ sin θ 0 sin θ cos θ R y ( θ ) = cos θ 0 sin θ 0 1 0 sin θ 0 cos θ R z ( θ ) = cos θ sin θ 0 sin θ cos θ 0 0 0 1
In particular, h = 0 n = 0 , h = 2 n = 4 , and h = 4 n = 2 . Recall that S 6 = I , and 2 and 4 are inverses in Z 6 , so we can generalize that n = h . Therefore, S h M k = ( S h M k S h ) S h = R S h where R is one of the rotation matrices.
Now, we claim that all possible strings of S and N can be reduced down to a product of rotation matrices and some power of S. First note that any string of S and N must alternate between powers of S and N, i.e. be in the form S a 1 N b 1 S a 2 N b 2 or N a 1 S b 1 N a 2 S b 2 , because if we have two adjacent powers of S or powers of N, we can always combine them and simplify using S 6 = N 30 = I .
Suppose we have the string S a 1 N b 1 S a 2 N b 2 . Consider the substring S a 1 N b 1 . From our observation above with rotation matrices, we can replace this substring with R 1 S a 1 where R 1 is one of the three rotation matrices. Then, our string can be rewritten as R 1 S a 1 S a 2 N b 2 = R 1 S a 1 + b 1 N b 2 . Now, we do the same thing with the substring S a 1 + b 1 N b 2 , and if we keep repeating the same process until we reach the end of the string, we end up with a product of rotation matrices with some leftover power of S at the end, i.e. something of the form R 1 R 2 R n S k . Our next step is to show that it’s not possible for R 1 R 2 R n to be a power of S. To do this, we claim that it’s not possible to have two adjacent rotation matrices to be the same. Consider the substring S a k N b k . From our previous observation, S a k N b k = R S a k . In order for the next substring to give us the same rotation matrix, a k + 1 would have to be zero, which would mean our original string was not simplified. Thus, because no two adjacent rotation matrices can be the same, and matrix multiplication is not commutative for rotation matrices around different axes, it’s not possible for R 1 R 2 R n to simplify down to something that equals the identity when raised to a certain power. Hence, we have shown that the only strings formed by S and T S that can give us the identity are the ones consisting of some combination of S 6 and ( T S ) 30 . This implies that our graph is indeed a tree, so by Theorem 2.1, we have our desired isomorphism.

3. Generalization to k Ropes

Based on the 2-rope and 3-rope cases, there is a clear pattern the property of S needs to follow in relation to the number of ropes there are. It seems J represents the identity if all the ropes were to be indistinguishable, whereas I represents the typical identity where the ropes are all unique. In other words, if there are k ropes, we can think of J as a 360 k rotation and I as a 360 rotation, so J k = I . Furthermore, we defined S as a 360 2 k rotation, since there are 2 k hands. Thus, with k ropes, we have the following conjecture:
S 2 = J , J k = I .
The generalization for T S is not as straightforward, as ( T S ) 6 = I for the 2-rope case and ( T S ) 30 = I for the 3-rope case. We came up with the following two conjectures for T S :
  • If we have k ropes, then ( T S ) n = I where n is the product of the first k primes.
  • If we have k ropes, then ( T S ) n = I where n is the product of the first k terms of the Fibonacci sequence beginning with 2 and 3 .

Acknowledgments

We would like to thank the PROMYS program for this opportunity for research. Furthermore, we want to extend our sincerest gratitude to David Fried for the introduction to the project, John Sim and Sterling Saint Rain for their valuable guidance and insights. Lastly, we would like to appreciate anyone who directly or indirectly assisted us in our research.
1
2
Ibid
3
4

References

  1. Serre, J.P. Trees, 1 ed.; Springer Berlin, Heidelberg, 1980. Original French edition published by Société Mathématique France, 1977. [CrossRef]
  2. Trinh, M.-T. Q. (2023). Tangles with k ropes and 2k hands.
  3. Yamagata, K.; Yamagishi, M. On the Ring of Integers of Real Cyclotomic Fields 2016. 92, 73–76. [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated