Scholarlink

Consider a robot that walks along a knot once on a knot diagram and switches every undercrossing it meets, stopping when it comes back to the starting position. We show that such a robot always unknots the knot. In fact, we prove that the robot produces an ascending diagram, and we prove that every ascending or descending knot diagram with C crossings can be transformed into the zero-crossing unknot diagram using at most (7C+1)C Reidemeister moves. Moreover, we show that an ascending or descending knot diagram can always be transformed into a zero-crossing unknot diagram using Reidemeister moves that do not increase the number of crossings.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

An unknotting robot

  • 章节

  • 发表日期：

    2026年

查看全文
  • Connie On Yu Hui,
  • Dionne Ibarra,
  • Louis H. Kauffman,
  • Emma N. McQuire,
  • Gabriel Montoya-Vega,
  • Sujoy Mukherjee,
  • Corbin Reid

摘要

Consider a robot that walks along a knot once on a knot diagram and switches every undercrossing it meets, stopping when it comes back to the starting position. We show that such a robot always unknots the knot. In fact, we prove that the robot produces an ascending diagram, and we prove that every ascending or descending knot diagram with C crossings can be transformed into the zero-crossing unknot diagram using at most (7C+1)C Reidemeister moves. Moreover, we show that an ascending or descending knot diagram can always be transformed into a zero-crossing unknot diagram using Reidemeister moves that do not increase the number of crossings.