arXiv · 2304.09304
Searching for ribbons with machine learning
Abstract
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\'e 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.
Explore related subjects
Keep this discovery
Sergei Gukov, James Halverson, Ciprian Manolescu, Fabian Ruehle. 2023-04-18. Searching for ribbons with machine learning. https://arxiv.org/abs/2304.09304
Cite the original work for its findings. Save a collection to share your selection of sources.