Searching for ribbons with machine learning
We apply Bayesian optimization and reinforcement learning to a problem in topology: the question of when a knot bounds a ribbon disk. This question is relevant in an approach to disproving the four-dimensional smooth Poincaré conjecture; using our programs, we rule out many potential counterexamples...
Saved in:
| Main Authors: | Sergei Gukov, James Halverson, Ciprian Manolescu, Fabian Ruehle |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2025-01-01
|
| Series: | Machine Learning: Science and Technology |
| Subjects: | |
| Online Access: | https://doi.org/10.1088/2632-2153/ade362 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Toulouse–Kleman homotopic classification of topological defects in ordered systems illustrated by experiments
by: Pieranski, Pawel, et al.
Published: (2024-12-01) -
Glueballonia as Hopfions
by: Yuki Amari, et al.
Published: (2025-10-01) -
Dislocations and fibrations: the topological structure of knotted defects in smectic liquid crystals
by: Paul G Severino, et al.
Published: (2025-01-01) -
Mechanically Interlocked Biomacromolecules
by: Yu-Xiang Wang, et al.
Published: (2024-12-01) -
Khovanov Laplacian and Khovanov Dirac for knots and links
by: Benjamin Jones, et al.
Published: (2025-01-01)