Frontiers of sphere recognition in practice | SpringerLink
Sphere recognition is known to be undecidable in dimensions five and beyond, and no polynomial time method is known in dimensions three and four. Here we report on positive and negative computational results with the goal to explore the limits of sphere recognition from a practical point of view. An important ingredient are randomly constructed discrete Morse functions.
Frontiers of sphere recognition in practice Open access Published: 19 May 2022 Volume 6 , pages 503–527 ( 2022 ) Cite this article You have full access to this open access article Download PDF Save article View saved research Journal of Applied and Computational Topology Aims and scope Submit manuscript Frontiers of sphere recognition in practice Download PDF Abstract Sphere recognition is known to be undecidable in dimensions five and beyond, and no polynomial time method is known in dimensions three and four. Here we report on positive and negative computational results with the goal to expl
Explore this link on the map →related reading
- n-sphere - Wikipediaen.wikipedia.org
- Largest empty sphere - Wikipediaen.wikipedia.org
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- An OpenAI model has disproved a central conjecture in discrete geometry | OpenAIopenai.com
- TU Berlin | CG | Marc Alexacg.tu-berlin.de
- When Models Manipulate Manifolds: The Geometry of a Counting Tasktransformer-circuits.pub
- Convex hull, Image processing, Image Classification, Image retrieval, Shape detectiondiva-portal.org
- Shtetl-Optimized >> Blog Archive >> Ten Signs a Claimed Mathematical Breakthrough is Wrongscottaaronson.blog
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Computational Complexityblog.computationalcomplexity.org
- unit-distance-remarks.pdfcdn.openai.com
- Paperscseweb.ucsd.edu