内容来源：https://www.quantamagazine.org/a-powerful-new-qr-code-untangles-maths-knottiest-knots-20260422/

内容总结：

【数学突破：新型“二维码”不变量高效破解复杂纽结分类难题】

在纯数学领域，纽结理论长期面临一项基础挑战：如何准确判断两个复杂纽结是否具有相同结构。传统纽结不变量往往面临“强不可算”或“易算弱效”的两难困境，尤其当纽结交叉点超过20个时，计算难度呈指数级增长。

近日，多伦多大学的德罗尔·巴尔-纳坦与格罗宁根大学的罗兰·范德芬合作，成功构建出一种兼具强大判别力与高效计算性的新型纽结不变量。该成果被同行评价为“如同发明了一台分辨率更高、探测距离延长十倍的新型望远镜”。

这项突破的核心在于将深奥的拓扑理论与高效算法相结合。研究者从1923年发现的亚历山大多项式出发，创新性地引入“多类型车流概率模型”，通过模拟车辆在纽结化高速公路上的动态行为，最终导出一个包含双变量的多项式不变量。尽管其数学形式复杂，但计算机可轻松处理高达300个交叉点的纽结，甚至已部分验证超过600个交叉点的案例。

实验数据显示，该不变量对18交叉点纽结的区分识别率超过97%，远超经典琼斯多项式（约42%）和亚历山大多项式（约11%）的表现。更引人注目的是，该多项式系数可转化为色彩斑斓的六边形“二维码”图案，每个图案如同雪花般独特，为纽结拓扑特征提供了可视化洞察。

研究者指出，这一工具不仅能高效区分纽结，更有望揭示纽结亏格等深层拓扑性质。目前学界普遍认为该不变量与“双环多项式”等价——后者作为康采维奇积分的二阶近似，此前因计算困难难以实际应用。若等价性获严格证明，将直接赋予新不变量丰富的拓扑解释。

这项研究标志着纽结理论方法论的重要转向：首次将可计算性置于设计理念的核心。正如研究者所言，他们“偶然走进了故事的中段”，而更多基于多变量扩展的同类不变量正等待探索。这项突破或将开启复杂纽结系统性分类的新纪元。

中文翻译：

一种强大的新型“二维码”解开了数学中最复杂的绳结

从电脑线缆的缠绕到猫咪弄乱的毛线篮，绳结在日常生活中无处不在。它们也遍布科学领域，出现在DNA环、缠绕的聚合物链以及旋涡水流中。而在纯数学领域，绳结是拓扑学中许多核心问题的关键。

然而，绳结理论家们仍在为最基本的问题而挣扎：如何区分两个不同的绳结。

仅凭观察，很难判断两个复杂的绳结是否具有相同的结构。即使它们看起来完全不同，你也可能通过移动一些绳股，将其中一个变成另一个。（对数学家来说，绳结的末端总是固定在一起的，因此这样的移动不会解开它。）

在过去的一个世纪里，绳结理论家们已经开发出一套清晰（尽管不完美）的工具来区分绳结。这些工具被称为绳结不变量，它们各自测量绳结的某个方面——可能是其交织绳股形成的图案，也可能是其周围空间的拓扑结构。如果你用一个不变量测量两个绳结，得到两个不同的结果，你就证明了它们是不同的。但反之则不一定成立：如果不变量给出相同的结果，绳结可能相同，也可能不同。

有些不变量在区分绳结方面比其他的更好，但这需要权衡：这些更强的不变量往往难以计算。"大多数不变量要么非常强大但无法计算，要么易于计算但非常弱，"悉尼大学的丹尼尔·图本豪尔说。

当绳结的交叉次数达到15或20次时，许多不变量就开始失效了——要么无法区分许多绳结，要么变得太难计算。多伦多大学的德罗尔·巴尔-纳坦说，对于大多数绳结不变量而言，"如果你说'300个交叉点'，然后说'计算'这个词，那你就是在讲科幻故事。"

但现在，巴尔-纳坦和荷兰格罗宁根大学的罗兰·范德芬提出了一种绳结不变量，它不需要数学家在两难之间做出选择：它既强大又易于计算。"它似乎正处于激动人心的事情发生的'甜蜜点'，"未参与此项工作的图本豪尔说。

这种力量与速度的结合意味着数学家可以探索以前遥不可及的绳结。对于多达300个交叉点的绳结，计算这个新不变量很容易，巴尔-纳坦和范德芬甚至计算了超过600个交叉点的绳结不变量的某些方面。

"这项突破堪比一种新型望远镜：它不仅能在熟悉的范围内提供更清晰的分辨率，还将我们的探测范围扩大了十倍，"耶路撒冷希伯来大学的吉尔·卡莱说。

对于每个绳结，这个不变量会输出一个彩色的六边形"二维码"，像雪花一样对称且细节精致。"输出结果异常美丽，变化多得令人难以置信，"不列颠哥伦比亚大学的利亚姆·沃森说，"它看起来就像来自另一个世界。"

数学家们希望这些错综复杂的图案能指引他们发现单个绳结更深层的拓扑特征。"你立刻就会开始好奇，"沃森说，"是这个给定的绳结的什么特性产生了这种特定图案？"

绳结的分类

想象一个游戏：你画一个绳结，并尝试用红、黄、蓝三种颜色给它的每一股上色。规则是：必须至少使用每种颜色一次，并且在每个交叉点，要么三种颜色都出现，要么只出现一种颜色。这对某些绳结是可能的，但对另一些则不行——例如，你可以给三叶结上色，但不能给八字结上色。

无论你如何进一步缠绕任何给定的绳结，如果它一开始是"可三色的"，那么它将一直保持可三色。同样，不可三色的绳结也一直保持不可三色。这使得三色性成为一个绳结不变量。

计算一个绳结是否可三色并不太难，但这个不变量在区分绳结方面并不擅长。它只是将绳结分成两个桶：可三色的和不可三色的。如果你试图区分的绳结碰巧在同一个桶里，那你就没办法了。你可以通过使用更多颜色和规则，以及测量绳结有多少种着色方式（而不仅仅是能否着色）来改进你的不变量。这些改进创造了更强的不变量，但它们也变得更难计算。

在过去的一个世纪里，绳结理论家们提出了数百个不变量。利用这些工具，他们成功地将超过20亿个交叉点不超过20个的绳结编入目录——考虑到既易于计算又强大的不变量稀缺，这是一项艰巨的工作。在识别绳结方面，"我们在100年绳结理论中拥有的工具并不是特别好，"图本豪尔说。

这部分是因为最强的绳结不变量往往源于对绳结内部深层拓扑结构的研究。但很少有绳结理论家既精通这些理论思想，又精通设计易于计算的不变量时需要考虑的计算问题。

巴尔-纳坦和范德芬这两位既是理论家又是熟练程序员的学者，是这个规则的例外。他们的新不变量源于深刻的拓扑思想，但到目前为止，他们主要专注于创建一个快速、强大的不变量。沃森说，以这种方式将可计算性作为优先考虑，在绳结理论中是"一种文化上的新事物"。

打结的高速公路

巴尔-纳坦通往新不变量的道路始于二十年前，当时他试图理解带状结——沿着一条穿过自身的带状物边界运行的绳结。这项工作促使他重新审视一个特别强大的不变量，称为孔采维奇积分，它内部包含了许多其他绳结不变量。数学家们推测这个不变量非常强大，足以区分所有绳结。

"我高兴了大约五分钟，"巴尔-纳坦说。然后他提醒自己，出于所有实际目的，孔采维奇积分是无法计算的。"它作为一个抽象事物存在，但你实际上无法从中推导出任何关于现实绳结的信息。"

巴尔-纳坦开始尝试用更易于计算、同时仍保留其部分有价值信息的不变量来近似孔采维奇积分。存在一个特定的自然不变量序列，能够捕捉孔采维奇积分越来越多的细节。但除了序列中的第一个成员外，没有人知道如何以高效的方式完全计算这些不变量。

2015年在奥胡斯大学的一次讲座中，巴尔-纳坦分发了一份描述其目标的手册。在底部，他用大号的洋红色斜体字写道："需要帮助！"听众中的范德芬响应了号召。两人一起试图找出如何超越序列中的第一个不变量。

他们首先研究了那个第一个不变量：所谓的亚历山大多项式，它于1923年被发现。在绳结的世界里，多项式将绳结的测量值转化为数字和变量的幂次组合，例如 3x⁷ + 8。（亚历山大多项式还涉及x的倒数的幂次。）在过去的一个世纪里，数学家们提出了几十种不同的方法来计算绳结的亚历山大多项式。巴尔-纳坦和范德芬着手推广其中一种方法，他们最终能够用交通语言来表述它。

想象一个绳结是一条单向高速公路，你在某处将其剪开，使其有起点和终点。进一步想象，每对交叉点之间有一座城市。如果一辆车从高速公路起点出发，它将在每个城市行驶一次，然后从终点驶出。

为了构造亚历山大多项式，假设在每个交叉点，都有一个从立交桥到下穿路的可选下匝道。当一辆车到达立交桥时，它有一定概率（称之为x）会走下匝道而不是继续走立交桥。（实际设置稍微复杂一些，有时涉及x的倒数。）

现在，一辆车不一定恰好经过每个城市一次。假设你在迈阿密投放100辆车，然后问有多少车流会经过亚特兰大。有些车可能访问亚特兰大一次，但其他车可能多次经过或完全绕过它。经过亚特兰大的预期车流量可以写成一个关于x的函数，该函数捕捉了绳结的股线如何相互缠绕的信息。

对于每一对城市，你都可以构造一个交通函数。这些函数的一个简单组合就产生了亚历山大多项式，即孔采维奇积分的第一个近似。

巴尔-纳坦和范德芬认为，通过创建一个涉及两种以不同概率（比如x和y）走下匝道的车辆的交通场景，或许可以为不变量序列中的第二步写下类似的公式。但尽管付出了许多努力，他们还是没能想出一个可行的交通设置。直到有一天，他们从亚原子粒子的数学中获得了灵感。

正如粒子可以结合或分裂成其他粒子一样，巴尔-纳坦和范德芬设想他们的两种类型的车辆有时会结合在一起形成第三种类型的车辆——就像一辆被另一辆拖行。然后这两辆车将作为一个单一车辆穿越高速公路。之后，它们可能会再次分开，各走各路。同样，你可以计算从迈阿密出发的车流有多少应该经过亚特兰大，但这次，你还要跟踪不同的车辆类型。

巴尔-纳坦和范德芬确信他们找到了正确的设置，但他们仍然不知道如何组合所有的交通函数来直接生成一个绳结不变量。不过，他们的设置确实让他们感受到了这样一个不变量应该具有的大致"形状"。于是他们采用了一个老技巧：简单地写出一个具有正确大致形状的公式，然后调整其系数，使其即使在绳结的股线被移动时也保持不变。

"在某种意义上，我们只是即兴发挥，"范德芬说。

结果是一个关于变量x和y的复杂多项式，让其他研究人员摸不着头脑。"你做了这些关于车辆、匝道和概率的复杂事情，而无论你取绳结的哪种图示，得出的答案都是一样的——这才是令人惊奇的地方，"悉尼大学的茹饶·丹索说，"他们到底是怎么想出来的？"

打结的梦想

虽然这个多项式看起来很混乱，但计算机可以轻松计算它，即使对于有数百个交叉点的绳结也是如此。而且它很强大：例如，图本豪尔计算出，该不变量能唯一识别超过97%的具有18个交叉点的绳结。相比之下，用于绳结编目的最广泛使用的不变量之一——琼斯多项式，只能识别约42%，而亚历山大多项式仅约11%。

"我认为，在可计算性和相对强度方面，没有什么能接近这个不变量，"沃森说。

通过将多项式的系数绘制成一种热图，研究人员创造了引人注目的视觉效果——为每个绳结生成一个华丽的六边形二维码。两个具有不同二维码的绳结保证是不同的绳结。

巴尔-纳坦和范德芬预计，这个二维码除了区分绳结之外，还将有许多用途。在他们论文中名为"故事、猜想与梦想"的部分，他们提出二维码可能有助于阐明绳结的一系列广泛的拓扑特征。例如，他们相信六边形的直径将为衡量绳结复杂性的一个指标（称为绳结的亏格，这对曲面研究也至关重要）提供一个下界。丹索说，如果这被证明是真的，"那意味着我们将能更好地计算大型绳结的亏格。"

巴尔-纳坦和范德芬以及其他研究人员确信，这个新不变量等同于孔采维奇积分的第二个近似，数学家称之为双环多项式，并已经研究了几十年。"我愿意用我的房子打赌，"北卡罗来纳大学教堂山分校的列夫·罗赞斯基说，他是最早研究双环多项式的学者之一。

在传统形式中，双环多项式难以计算但拓扑内容丰富。因此，证明这种等价性将立即确认巴尔-纳坦和范德芬赋予其新不变量的许多拓扑能力。即便如此，作者们希望最终能够以一种不那么复杂的方式解释这个新不变量。"一个基本的构造应该有一个简单的解释，"他们写道。

在某种意义上，他们觉得自己偶然进入了故事的中间部分。"我们对开头和结尾都相当不确定，"他们写道。

与此同时，没有什么能阻止研究人员尝试创建具有更多车辆和变量的交通设置，以试图捕捉孔采维奇积分中存储的越来越多的信息。"有一整个类似的东西的'动物园'在等着我们，"范德芬说。

英文来源：

A Powerful New ‘QR Code’ Untangles Math’s Knottiest Knots
Introduction
From the tangle in your computer cord to the mess your cat made of your knitting basket, knots are everywhere in daily life. They also pervade science, showing up in loops of DNA, intertwined polymer strands, and swirling water currents. And within pure mathematics, knots are the key to many central questions in topology.
Yet knot theorists still struggle with the most basic of questions: how to tell two knots apart.
It’s hard to decide whether two complicated knots have the same structure just by looking at them. Even if they appear completely different, you might be able to turn one into the other by moving some strands around. (To a mathematician, the ends of a knot are always fastened together so that such motions won’t untie it.)
Over the past century, knot theorists have developed a set of clear, if imperfect, tools for distinguishing knots. Called knot invariants, these tools each measure some aspect of a knot — a pattern formed by its interwoven strands, perhaps, or the topology of the space surrounding it. If you use an invariant to measure two knots and you get two different results, you’ve proved the knots are different. But the reverse isn’t always true: If the invariant gives you identical results, the knots may be the same, or they may be different.
Some invariants are better at telling knots apart than others, but there’s a trade-off: These stronger invariants tend to be hard to calculate. “Most invariants are either very strong but impossible to compute, or easy to compute but very weak,” said Daniel Tubbenhauer of the University of Sydney.
By the time you’re up to knots whose strands cross each other 15 or 20 times, many invariants start to falter — either they fail to distinguish between many knots, or they’re getting too hard to compute. For most knot invariants, said Dror Bar-Natan of the University of Toronto, “if you say ‘300 crossings’ and then you say the word ‘compute,’ you are in science fiction.”
But now, Bar-Natan and Roland van der Veen of the University of Groningen in the Netherlands have come up with a knot invariant that does not require mathematicians to choose between two evils: It is both strong and easy to compute. “It seems to be right in the sweet spot where exciting things happen,” said Tubbenhauer, who was not involved in the work.
This combination of strength and speed means that mathematicians can probe knots that were previously far out of reach. It’s easy to calculate the new invariant for knots with as many as 300 crossings, and Bar-Natan and van der Veen have even calculated some aspects of the invariant for knots with more than 600 crossings.
“This breakthrough is comparable to a new kind of telescope: one that not only provides much sharper resolution over familiar ranges, but also extends our reach by a factor of 10,” said Gil Kalai of the Hebrew University of Jerusalem.
For each knot, the invariant outputs a colorful hexagonal “QR code,” as symmetric and delicately detailed as a snowflake. “The output is phenomenally beautiful and unbelievably varied,” said Liam Watson of the University of British Columbia. “It just seems to come from another world.”
Mathematicians hope that these intricate motifs will point them toward deeper topological features of individual knots. “You immediately start to wonder,” Watson said, “what was it about this given knot that produced this particular pattern?”
Buckets of Knots
Consider a game in which you draw a knot and try to color each of its strands red, yellow, or blue. The rules are that you must use each color at least once, and that at every crossing, either all three colors appear or only one does. This is possible for some knots, but not others — for example, you can color a trefoil knot, but not a figure-eight knot.
No matter how you further tangle any given knot, if it starts out “three-colorable” then it will remain so. Likewise, knots that aren’t three-colorable stay that way. That makes three-coloring a knot invariant.
It’s not so hard to calculate whether a knot is three-colorable, but this invariant is not very good at distinguishing between knots. It separates knots into just two buckets: three-colorable and not three-colorable. If the knots you’re trying to distinguish happen to be in the same bucket, you’re out of luck. You could improve your invariant by using more colors and rules, and by measuring how many colorings a knot has instead of just whether it can be colored. These refinements create stronger invariants, but they also get harder to calculate.
Over the past century, knot theorists have come up with hundreds of invariants. Using these tools, they’ve managed to catalog the more than 2 billion knots with 20 or fewer crossings — a heroic effort, considering the shortage of invariants that are both computable and strong. When it comes to identifying knots, “the tools we have in 100 years of knot theory are not particularly great,” Tubbenhauer said.
This is partly because the strongest knot invariants tend to emerge from the study of profound topological structures within knots. But few knot theorists are versed in both these theoretical ideas and the computational considerations that go into devising invariants that are easy to calculate.
Bar-Natan and van der Veen, two theoreticians who are also adept programmers, are exceptions to this rule. Their new invariant grew out of deep topological ideas, but for now they’ve mainly focused on creating a fast, strong invariant. Making computability the priority in this way is “something culturally new” in knot theory, Watson said.
A Knotted Highway
Bar-Natan’s path to the new invariant started two decades ago when he was trying to understand ribbon knots — knots that run along the boundary of a ribbon that passes through itself. The work led him to revisit a particularly powerful invariant called the Kontsevich integral, which contains many other knot invariants rolled up inside it. Mathematicians have conjectured that this invariant is so strong that it can distinguish between all knots.
“For about five minutes I was happy,” Bar-Natan said. Then he reminded himself that for all practical purposes, the Kontsevich integral is impossible to compute. “It exists as an abstract thing, but you cannot actually deduce anything about any real-life knot from it.”
Bar-Natan set about trying to approximate the Kontsevich integral with more computable invariants that still preserve some of its valuable information. There’s a certain natural sequence of invariants that capture more and more details of the Kontsevich integral. But no one knew how to fully compute these invariants in an efficient way, except for the first member of the sequence.
At a lecture at Aarhus University in 2015, Bar-Natan distributed a handout describing his goals. At the bottom, in large magenta italics, he wrote, “Help Needed!” Van der Veen, who was in the audience, answered the call. Together, the pair tried to figure out how to move beyond the first invariant in the sequence.
They began by looking at that first invariant: the so-called Alexander polynomial, which was discovered in 1923. In the world of knots, a polynomial converts measurements on a knot into a combination of numbers and variables raised to powers, such as 3x7 + 8. (The Alexander polynomial also involves powers of the reciprocal of x.) Over the past century, mathematicians have come up with dozens of different methods to calculate the Alexander polynomial of a knot. Bar-Natan and van der Veen set out to generalize one of these methods, which they were eventually able to formulate in the language of car traffic.
Imagine a knot as a one-way highway that you’ve snipped open somewhere so that it has a beginning and an end. Imagine further that there’s a city between each pair of crossings. If a car starts at the beginning of the highway, it will drive through each city once before falling off the end.
To construct the Alexander polynomial, imagine that at each crossing, there’s an optional down ramp from the overpass to the underpass. When a car reaches an overpass, there’s some probability — call it x — that the car will take the down ramp instead of the overpass. (The actual setup is a bit more complicated, sometimes involving the reciprocal of x.)
Now a car won’t necessarily drive through each city exactly once. Suppose you launch 100 cars in Miami and ask how much traffic will pass through Atlanta. Some cars might visit Atlanta once, but others might go through it multiple times or bypass it entirely. The expected amount of traffic through Atlanta can be written as a function of x that captures information about how the strands of the knot wind in and out of each other.
For each pair of cities, you can construct a traffic function. A simple combination of these functions then produces the Alexander polynomial, the first approximation of the Kontsevich integral.
Bar-Natan and van der Veen thought it might be possible to write down a similar formula for the second step in the sequence of invariants by creating a traffic scenario involving two kinds of cars that take the down ramp with different probabilities (say, x and y). But despite many efforts, they couldn’t figure out a traffic setup that worked. Then one day, they took inspiration from the mathematics of subatomic particles.
Just as particles can combine or split apart into other particles, Bar-Natan and van der Veen envisioned their two types of cars sometimes coming together to form a third type of vehicle — as if one were being towed by the other. The two cars would then traverse the highway as a single vehicle. Later, they might split apart again and go their separate ways. Once again, you can calculate how much of the traffic starting in Miami should pass through Atlanta, but this time, you also keep track of the different vehicle types.
Bar-Natan and van der Veen felt convinced that they had hit on the right setup, but they still didn’t know how to combine all their traffic functions to directly generate a knot invariant. What their setup did give them, though, was a feel for the general “shape” such an invariant should have. So they resorted to an old trick, simply writing down a formula in the correct general shape and then adjusting its coefficients to make it stay invariant even when the strands of the knot got moved around.
“We in some sense just winged it,” van der Veen said.
The result, a convoluted polynomial in the variables x and y, has left other researchers scratching their heads. “The fact that you do this complicated thing with the cars and the turnoffs and the probabilities, and the answer that comes out of it will be the same no matter what picture of the knot you took — that’s the amazing thing,” said Zsuzsanna Dancso of the University of Sydney. “How the heck did they come up with it?”
Knotted Dreams
While the polynomial looks messy, a computer can calculate it easily, even for knots with hundreds of crossings. And it is strong: Tubbenhauer computed, for instance, that the invariant uniquely identifies more than 97% of the knots with 18 crossings. By comparison, the Jones polynomial, one of the most widely used invariants for cataloging knots, identifies about 42%, and the Alexander polynomial only about 11%.
“I think there’s nothing that comes close to the computability and relative power of this invariant,” Watson said.
By plotting the coefficients of the polynomial as a sort of heat map, the researchers have created striking visuals — an ornate hexagonal QR code for each knot. Two knots with different QR codes are guaranteed to be different knots.
Bar-Natan and van der Veen expect that this QR code will have many uses beyond distinguishing between knots. In a section of their paper called “Stories, Conjectures, and Dreams,” they propose that the QR code might help elucidate a broad array of topological features of knots. For instance, the hexagon’s diameter, they believe, will put a lower bound on a measure of knot complexity called the knot’s genus (which is also crucial to the study of surfaces). If this proves true, Dancso said, “that means we are going to be much better at calculating the genus of large knots.”
Bar-Natan and van der Veen, as well as other researchers, are convinced that the new invariant is equivalent to the second approximation to the Kontsevich integral, which mathematicians call the two-loop polynomial and have been studying for decades. “I would bet my house” on it, said Lev Rozansky of the University of North Carolina, Chapel Hill, one of the first to study the two-loop polynomial.
In its traditional form, the two-loop polynomial is hard to compute but topologically rich. So proving this equivalence would instantly confirm much of the topological power that Bar-Natan and van der Veen ascribe to their new invariant. Even so, the authors hope that they will eventually be able to explain the new invariant in a less complicated way. “An elementary construction ought to have a simple explanation,” they wrote.
In a sense, they feel that they’ve stumbled into the middle of the story. “We are quite unsure about the beginning and the end,” they wrote.
Meanwhile, there’s nothing stopping researchers from trying to create traffic setups with even more cars and variables, to try to capture more and more of the information stored in the Kontsevich integral. “There’s a whole zoo of similar-type things just waiting for us,” van der Veen said.