Negative-Definite Plumbings and New Unknotting Numbers

In the world of knots, a field of mathematics that studies how loops of string can twist and tangle in three-dimensional space, there is a fundamental question that has puzzled researchers for decades: how many times must you cut and rejoin a knot to turn it into a simple, untangled circle? This number is called the unknotting number. While the definition is simple, finding the exact answer for a specific knot is notoriously difficult. Mathematicians have long relied on various tools to estimate this number, often narrowing it down to a small range, such as knowing a knot requires either two or three changes, but unable to say which one is correct. For many knots with up to thirteen crossings, the exact number remained a mystery, leaving a gap in our understanding of the geometry of tangled strings.

To solve these mysteries, researchers look at the knot not just as a line in space, but as a boundary that defines a hidden, complex shape. If you take a knot and create a special double-layered version of the space around it, you get a three-dimensional object called a double branched cover. This object holds deep secrets about the original knot. If the knot can be untangled with a single move, this hidden shape must have a very specific, simple structure. If it requires more moves, the shape becomes more complicated. By analyzing the geometry of these hidden shapes, mathematicians can often rule out the possibility that a knot is simpler than it appears, effectively raising the lower limit of how many moves are needed to untie it.

A researcher has now applied a powerful new method to solve this problem for a large collection of knots that were previously stuck in uncertainty. They focused on 1,150 non-alternating knots with up to thirteen crossings. These are knots that do not follow a simple, predictable pattern of over-and-under crossings, making them much harder to study than their simpler cousins. The researcher's goal was to determine the exact unknotting number for as many of these knots as possible. To do this, they used a technique involving "plumbing trees," which are diagrams that describe how to build complex three-dimensional shapes by gluing together simple tube-like pieces. They specifically looked for a type of plumbing tree that is "negative-definite," a mathematical property that acts like a fingerprint for certain geometric structures.

The researcher developed a systematic way to check if the hidden shape of a knot could be built from such a tree. They started by using computer software to recognize the geometric structure of the double branched cover for each knot. When the software could identify the shape as a specific type of geometric object known as a Seifert fibred space or a graph manifold, the researcher could reverse-engineer the plumbing tree that would create it. In cases where the software could not recognize the shape, they turned to the knot's diagram itself, using a set of rules to translate the visual tangle directly into a plumbing tree. By comparing the properties of these trees against the known properties of the knots, they could determine whether the hidden shape allowed for a simple untangling or if it was too complex to be unknotted with very few moves.

The results were decisive. The researcher found that for 180 of the knots in their list, the hidden shape could indeed be described by a negative-definite plumbing tree. For these knots, they were able to calculate precise mathematical values that act as obstructions. These calculations proved that for 41 of these knots, it is impossible to untie them with just one move, forcing their unknotting number to be at least two. For two other knots, the calculations showed that two moves were not enough, pushing the number to at least three. This settled the exact unknotting numbers for these 43 knots, moving them from a range of possibilities to a single, confirmed value.

For the remaining 970 knots in the study, the researcher found that no matter how they oriented the hidden shape, it could not be built from a negative-definite plumbing tree. This does not mean the knots are easy to untie; rather, it means that this specific geometric tool cannot be used to find the answer for them. However, the researcher did not stop there. For a subset of these knots, they applied a different method based on how the strands of the knot link together. They proved that for 66 of these knots, the unknotting number is exactly three. They also identified three special knots that require five moves to untie, a result derived from a theorem that applies only to knots with a very specific alternating pattern. In total, the study determined the exact unknotting numbers for 112 knots that were previously unknown, significantly expanding the map of what we know about tangled strings.

Beyond just counting moves, the research also challenged a long-standing idea in knot theory known as the Bernhard–Jablan conjecture. This conjecture suggests that the minimum number of moves needed to untie a knot can always be found by looking at the knots that result from changing just one crossing in the knot's simplest diagram. The researcher tested this idea on a specific knot, 13n1587, which was already known to be a counterexample to a weaker version of the idea. By examining every possible single crossing change in the knot's minimal diagrams, they proved that every resulting knot still requires at least two moves to untie. This means that the original knot, which can be untied in two moves, cannot be reached from any of these simpler-looking neighbors in a single step. This finding confirms that 13n1587 is a definitive counterexample to the full conjecture, showing that the path to untying a knot is not always as straightforward as looking at its immediate neighbors.

The work relied heavily on rigorous verification. The researcher did not just trust the computer's initial identification of the shapes; they cross-checked their findings by building the shapes from scratch using different methods and comparing the results. They used multiple independent programs to calculate the critical values, ensuring that no single error could skew the outcome. They also tested their methods on knots where the answer was already known to confirm that their approach was working correctly. This careful, multi-layered verification process gives the new numbers a high degree of certainty. The study has effectively cleared the fog for over a hundred knots, providing a solid foundation for future research and demonstrating that even in a field as abstract as knot theory, precise answers can be found through a combination of geometric insight and computational power.