Abstract
The problem of determining whether a given (finite abstract) simplicial complex is homeomorphic to a sphere is undecidable. Still, the task naturally appears in a number of practical applications and can often be solved, even for huge instances, with the use of appropriate heuristics. We report on the current status of suitable techniques and their limitations. We also present implementations in polymake and relevant test examples.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adiprasito, K., Benedetti, B., Lutz, F.H.: Extremal examples of collapsible complexes and random discrete morse theory. arXiv:1404.4239, 20 pages (2014)
Benedetti, B., Lutz, F.H.: Knots in collapsible and non-collapsible balls. Electron. J. Comb. 20(3), Research Paper P31, 29 p. (2013)
Benedetti, B., Lutz, F.H.: Random discrete Morse theory and a new library of triangulations. Exp. Math. 23, 66–94 (2014)
Benedetti, B., Ziegler, G.M.: On locally constructible spheres and balls. Acta Math. 206, 205–243 (2011)
Björner, A., Lutz, F.H.: Simplicial manifolds, bistellar flips and a 16-vertex triangulation of the Poincaré homology 3-sphere. Exp. Math. 9, 275–289 (2000)
Brehm, U., Kühnel, W.: 15-vertex triangulations of an 8-manifold. Math. Ann. 294, 167–193 (1992)
Burton, B.A.: Simplification paths in the Pachner graphs of closed orientable 3-manifold triangulations. arXiv:1110.6080, 39 pages (2011)
Burton, B.A.: Regina: A normal surface theory calculator, version 4.95 (1999-2013), http://regina.sourceforge.net
CAPD::RedHom. Redhom software library, http://redhom.ii.uj.edu.pl
Chernavsky, A.V., Leksine, V.P.: Unrecognizability of manifolds. Ann. Pure Appl. Logic 141, 325–335 (2006)
CHomP. Computational Homology Project, http://chomp.rutgers.edu
Forman, R.: Morse theory for cell complexes. Adv. Math. 134, 90–145 (1998)
Forman, R.: A user’s guide to discrete Morse theory. Sémin. Lothar. Comb 48(B48c), 35 p., electronic only. (2002)
Freedman, M.H.: The topology of four-dimensional manifolds. J. Differ. Geom. 17, 357–453 (1982)
Gawrilow, E., Joswig, M.: Polymake: a framework for analyzing convex polytopes. In: Polytopes—Combinatorics and Computation (Oberwolfach, 1997). DMV Sem., vol. 29, pp. 43–73. Birkhäuser, Basel (2000)
Joswig, M.: Computing invariants of simplicial manifolds, preprint arXiv:math/0401176 (2004)
Joswig, M., Pfetsch, M.E.: Computing optimal Morse matchings. SIAM J. Discrete Math. 20, 11–25 (2006)
Kaibel, V., Pfetsch, M.E.: Computing the face lattice of a polytope from its vertex-facet incidences. Comput. Geom. 23, 281–290 (2002)
King, S.A.: How to make a triangulation of S 3 polytopal. Trans. Am. Math. Soc. 356, 4519–4542 (2004)
Lewiner, T., Lopes, H., Tavares, G.: Optimal discrete Morse functions for 2-manifolds. Comput. Geom. 26, 221–233 (2003)
Matveev, S.V.: An algorithm for the recognition of 3-spheres (according to Thompson). Sb. Math. 186, 695–710 (1995), Translation from Mat. Sb. 186, 69–84 (1995)
Mijatović, A.: Simplifying triangulations of S 3. Pac. J. Math. 208, 291–324 (2003)
Munkres, J.R.: Elements of Algebraic Topology. Addison-Wesley Publishing Company, Menlo Park (1984)
Novikov, P.S.: On the algorithmic unsolvability of the word problem in group theory. Trudy Matematicheskogo Instituta imeni V. A. Steklova, vol. 44. Izdatel’stvo Akademii Nauk SSSR, Moscow (1955)
Perelman, G.: The entropy formula for the Ricci flow and its geometric applications. arXiv:math.DG/0211159, 39 pages (2002)
Rubinstein, J.H.: An algorithm to recognize the 3-sphere. In: Chatterji, S.D. (ed.) Proc. Internat. Congr. of Mathematicians, ICM 1994, Zürich, vol. 1, pp. 601–611. Birkhäuser Verlag, Basel (1995)
Saucan, E., Appleboim, E., Zeevi, Y.Y.: Sampling and reconstruction of surfaces and higher dimensional manifolds. J. Math. Imaging Vision 30(1), 105–123 (2008)
Seifert, H., Threlfall, W.: Lehrbuch der Topologie. B. G. Teubner, Leipzig (1934)
Smale, S.: On the structure of manifolds. Am. J. Math. 84, 387–399 (1962)
Spreer, J., Kühnel, W.: Combinatorial properties of the K3 surface: Simplicial blowups and slicings. Exp. Math. 20, 201–216 (2011)
Sulanke, T., Lutz, F.H.: Isomorphism free lexicographic enumeration of triangulated surfaces and 3-manifolds. Eur. J. Comb. 30, 1965–1979 (2009)
Thompson, A.: Thin position and the recognition problem for S 3. Math. Res. Lett. 1, 613–630 (1994)
Tsuruga, M., Lutz, F.H.: Constructing complicated spheres. arXiv:1302.6856, EuroCG 2013, 4 pages (2013)
Volodin, I.A., Kuznetsov, V.E., Fomenko, A.T.: The problem of discriminating algorithmically the standard three-dimensional sphere. Russ. Math. Surv. 29(5), 71–172 (1974)
Whitehead, J.H.C.: Simplicial spaces, nuclei and m-groups. Proc. Lond. Math. Soc., II. Ser. 45, 243–327 (1939)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joswig, M., Lutz, F.H., Tsuruga, M. (2014). Heuristics for Sphere Recognition. In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_26
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)