Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
The unknotting number, hard unknot diagrams, and reinforcement learning
by
Edlich, Thomas
, Juhász, András
, Blackwell, Sam
, Applebaum, Taylor
, Tomašev, Nenad
, Lackenby, Marc
, Davies, Alex
, Zheng, Daniel
in
Knot theory
/ Knots
/ Upper bounds
2025
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
The unknotting number, hard unknot diagrams, and reinforcement learning
by
Edlich, Thomas
, Juhász, András
, Blackwell, Sam
, Applebaum, Taylor
, Tomašev, Nenad
, Lackenby, Marc
, Davies, Alex
, Zheng, Daniel
in
Knot theory
/ Knots
/ Upper bounds
2025
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
The unknotting number, hard unknot diagrams, and reinforcement learning
Paper
The unknotting number, hard unknot diagrams, and reinforcement learning
2025
Request Book From Autostore
and Choose the Collection Method
Overview
We have developed a reinforcement learning agent that often finds a minimal sequence of unknotting crossing changes for a knot diagram with up to 200 crossings, hence giving an upper bound on the unknotting number. We have used this to determine the unknotting number of 57k knots. We took diagrams of connected sums of such knots with oppositely signed signatures, where the summands were overlaid. The agent has found examples where several of the crossing changes in an unknotting collection of crossings result in hyperbolic knots. Based on this, we have shown that, given knots \\(K\\) and \\(K'\\) that satisfy some mild assumptions, there is a diagram of their connected sum and \\(u(K) + u(K')\\) unknotting crossings such that changing any one of them results in a prime knot. As a by-product, we have obtained a dataset of 2.6 million distinct hard unknot diagrams; most of them under 35 crossings. Assuming the additivity of the unknotting number, we have determined the unknotting number of 43 at most 12-crossing knots for which the unknotting number is unknown.
Publisher
Cornell University Library, arXiv.org
Subject
This website uses cookies to ensure you get the best experience on our website.