On the homeomorphism problem for 4-manifolds
Cameron McA Gordon

TL;DR
This paper proves that there is no algorithm to determine whether a 4-manifold is homeomorphic to a connected sum of 12 S^2 imes S^2, highlighting fundamental limits in 4-manifold topology.
Contribution
It establishes the undecidability of the homeomorphism problem for certain 4-manifolds, advancing understanding of computational complexity in topology.
Findings
No algorithm can decide the homeomorphism to the connected sum of 12 S^2 imes S^2.
The result demonstrates fundamental undecidability in 4-manifold topology.
Highlights limits of algorithmic approaches in high-dimensional topology.
Abstract
We show that there is no algorithm to decide whether or not a given 4-manifold is homeomorphic to the connected sum of 12 copies of S^2 \times S^2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Point processes and geometric inequalities · Mathematical Dynamics and Fractals
