14
$\begingroup$

I recently learned the following rather fun game: a group of people is standing up roughly in circle, facing each other. Then participants randomly join hands, in such a way that nobody holds its own hand, and that everybody hold hands with two distinct person.

The result is clearly a link, and the goal of the game is to untangle it, i.e. participants have to move while still holding hands until they can stand up in (possibly several !) circle(s) holding hands with their direct left and right neighboors. Obviously people are allowed to not face the center of the circle (or to be upside down, I guess) so that the first Reidemeister move is allowed, but I guess it's not really important.

Clearly it requires quite some physical and intellectual skills, a lot of collaboration between the players, and a rather long time, which makes it a fun activity, and I recommend trying this at home with friends or at work with fellow mathematicians.

The person who explained the game sweared that it "always works", although it's fairly easy for someone having heard of knot theory to come up with an example where it doesn't. For example the trefoil is easily obtained already with 3 players, but it's also clear that this correspond to a rather particular choice.

In fact, this one time we actually did not manage to untangle the link though we managed to simplify it a lot. Of course even if the link is mathematically trivial it might be physically challenging to actually untangle it, but let's ignore that.

Basically, this game can be formalized as a process which generate links randomly, and I'm curious whether something interesting can be said about it. I must admit that since this question did not actually come up in my research I haven't given much thought about it.. Obvious questions are: can every link be obtained this way ? If not do they correspond to a known family of links ? Is there any way to support the organizer's claim, ie is there a way to estimate the probability of getting a trivial link ?

$\endgroup$
  • 6
    $\begingroup$ Two references, neither of which I can access: (1) Dreyer, P. A. "Knot Theory and the Human Pretzel Game." Congressus Numerantium (1996): 99-108. (2) M. B. Rao, Kalyaa Rao and Christopher N. Swanson. "Probability in the Human Knot Game," Applied Probability Trust, 2012. $\endgroup$ – Joseph O'Rourke May 10 '15 at 16:06
  • 2
    $\begingroup$ Here's a barely-related story. At Canada/USA Mathcamp (where I've been a counselor), there are a number of games played in groups like this, a popular one being "scream toes". N people stand in a circle, bow their heads, and each chooses a set of toes of some other person. At some signal, everyone looks up at the person whose toes they chose. If two people make eye contact, both scream, hence the name. That's the game; repeat until the neighbors complain about the noise. Anyway, a cute problem for high school math kids is the following: as $N \to \infty$, how many people scream each time? $\endgroup$ – Theo Johnson-Freyd May 10 '15 at 16:28
  • $\begingroup$ What about the following definition of a "human knot" (which neglects articulations and supposes elastic arms): A knot is "$N-$human" if it can be realized as a piecewise affine knot of $\mathbb R^3$ consisting of $N$ segments such that all $N$ vertices are on a cylinder (ie. project on a circle in a suitable direction). $\endgroup$ – Roland Bacher May 11 '15 at 12:23
  • $\begingroup$ A related question: mathoverflow.net/questions/54412/… . $\endgroup$ – Marco Golla Aug 10 '15 at 18:57
  • $\begingroup$ see this question mathoverflow.net/questions/206214/human-knot-game?rq=1 $\endgroup$ – M.U. Aug 10 '15 at 18:57
8
$\begingroup$

Yes, every link can be obtained in this way. Here's an inefficient way to do it. Put the link in braid form (via Alexander's theorem); suppose that we have $b$ strands. We'll achieve each braid generator as a certain pattern among $2b$ people on the circumference of the circle.

Here's a picture that explains better than my words can. All the horizontal (red) strands pass over the vertical (blue) strands. The two half-flips introduced cancel each other out (though they conjugate the braid generator) and we can clearly make all braid generators (and join them together!), hence all links.

enter image description here

With a little more thought we can arrange the half-flips and modify the generators accordingly to eliminate the factor of 2, giving a quantitative (though not at all sharp!) bound of $\mathrm{min}_{\hat{b} = K}\mathrm{length}(b)\mathrm{width}(b)$ for the number of people needed.

$\endgroup$
  • $\begingroup$ I might misunderstand, but this seems to ignore the practical consideration of how long people's arms are. If $b$ is a large enough number and we demand that everyone stand roughly on a circle then at some point people will not be physically able to reach horizontally across the circle. So I think a full "real life" answer to this problem would also impose some requirement concerning the lengths of the arcs (arms) and and a small requirement on how far a node is allowed to move off the circle. $\endgroup$ – Greg Friedman Aug 12 '15 at 4:10
  • $\begingroup$ Oops, sorry didn't notice Ryan's hidden comment above before adding mine. $\endgroup$ – Greg Friedman Aug 12 '15 at 4:11
  • $\begingroup$ For human arms the maximum braid-width is probably 3 or 4. However if you have rope handcuffs you can go indefinitely high! (Though if you have rope handcuffs there are probably more exciting uses.) $\endgroup$ – dvitek Aug 12 '15 at 14:14
  • $\begingroup$ Note that if you allow folks to stand in concentric circles then you can get arbitrarily large braid-width, though. So perhaps a better model is to just have a big clump of people. $\endgroup$ – dvitek Aug 12 '15 at 14:31

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.