Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2304.09304 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913890454994944 |
|---|---|
| author | Gukov, Sergei Halverson, James Manolescu, Ciprian Ruehle, Fabian |
| author_facet | Gukov, Sergei Halverson, James Manolescu, Ciprian Ruehle, Fabian |
| contents | 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 to the conjecture. We also show that the programs are successful in detecting many ribbon knots in the range of up to 70 crossings. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2304_09304 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Searching for ribbons with machine learning Gukov, Sergei Halverson, James Manolescu, Ciprian Ruehle, Fabian Geometric Topology Machine Learning 57K10 (Primary), 57K40, 68T99 (Secondary) 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 to the conjecture. We also show that the programs are successful in detecting many ribbon knots in the range of up to 70 crossings. |
| title | Searching for ribbons with machine learning |
| topic | Geometric Topology Machine Learning 57K10 (Primary), 57K40, 68T99 (Secondary) |
| url | https://arxiv.org/abs/2304.09304 |