Computational topology

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular computational geometry and computational complexity theory.

A primary concern of algorithmic topology, as its name suggests, is to develop efficient algorithms for solving topological problems using topological methods from computable topology to solve algorithmic problems from other fields.

Major algorithms by subject area[edit]

Algorithmic 3-manifold theory[edit]

A large family of algorithms concerning 3-manifolds revolve around normal surface theory, which is a phrase that encompasses several techniques to turn problems in 3-manifold theory into integer linear programming problems.

  • Rubinstein and Thompson's 3-sphere recognition algorithm. This is an algorithm that takes as input a triangulated 3-manifold and determines whether or not the manifold is homeomorphic to the 3-sphere. It has exponential run-time in the number of tetrahedral simplexes in the initial 3-manifold, and also an exponential memory profile. Moreover, it is implemented in the software package Regina.[1] Saul Schleimer went on to show the problem lies in the complexity class NP.[2]
  • The connect-sum decomposition of 3-manifolds is also implemented in Regina, has exponential run-time and is based on a similar algorithm to the 3-sphere recognition algorithm.
  • Determining that the Seifert-Weber 3-manifold contains no incompressible surface has been algorithmically implemented by Burton, Rubinstein and Tillmann [3] and based on normal surface theory.

At present the JSJ decomposition has not been implemented algorithmically in computer software. Neither has the compression-body decomposition. There are some very popular and successful heuristics, such as SnapPea which has much success computing approximate hyperbolic structures on triangulated 3-manifolds. It is known that the full classification of 3-manifolds can be done algorithmically.[5]

Conversion algorithms[edit]

  • SnapPea implements an algorithm to convert a planar knot or link diagram into a cusped triangulation. This algorithm has a roughly linear run-time in the number of crossings in the diagram, and low memory profile. The algorithm is similar to the Wirthinger algorithm for constructing presentations of the fundamental group of link complements given by planar diagrams. Similarly, SnapPea can convert surgery presentations of 3-manifolds into triangulations of the presented 3-manifold.
  • D.Thurston and F.Costantino have a procedure to construct a triangulated 4-manifold from a triangulated 3-manifold. Similarly, it can be used to construct surgery presentations of triangulated 3-manifolds, although the procedure is not explicitly written as an algorithm in principle it should have polynomial run-time in the number of tetrahedra of the given 3-manifold triangulation.[6]
  • S. Schleimer has an algorithm which produces a triangulated 3-manifold, given input a word (in Dehn twist generators) for the mapping class group of a surface. The 3-manifold is the one that uses the word as the attaching map for a Heegaard splitting of the 3-manifold. The algorithm is based on the concept of a layered triangulation.

Algorithmic knot theory[edit]

  • Determining whether or not a knot is trivial is known to be in the complexity class NP [7]
  • The problem of determining the genus of a knot is known to have complexity class PSPACE.

Computational homotopy[edit]

Computational homology[edit]

Computation of homology groups of cell complexes reduces to bringing the boundary matrices into Smith normal form. Although this is a completely solved problem algorithmically, there are various technical obstacles to efficient computation for large complexes. There are two central obstacles. Firstly, the basic Smith form algorithm has cubic complexity in the size of the matrix involved since it uses row and column operations which makes it unsuitable for large cell complexes. Secondly, the intermediate matrices which result from the application of the Smith form algorithm get filled-in even if one starts and ends with sparse matrices.

  • Efficient and probabilistic Smith normal form algorithms, as found in the LinBox library.
  • Simple homotopic reductions for pre-processing homology computations, as in the Perseus software package.
  • Algorithms to compute persistent homology of filtered complexes.

See also[edit]

References[edit]

  1. ^ B.~Burton. Introducing Regina, the 3-manifold topology software, Experimental Mathematics 13 (2004), 267–272.
  2. ^ http://www.warwick.ac.uk/~masgar/Maths/np.pdf
  3. ^ B. A. Burton, J. H. Rubinstein and S. Tillmann, The Weber–Seifert dodecahedral space is non-Haken, Transactions of the American Mathematical Society 364 (2012), 911–932
  4. ^ J.Manning, Algorithmic detection and description of hyperbolic structures on 3-manifolds with solvable word problem, Geometry and Topology 6 (2002) 1–26
  5. ^ S.Matveev, Algorithmic topology and the classification of 3-manifolds, Springer-Verlag 2003
  6. ^ F. Costantino, D.Thurston. 3-manifolds efficiently bound 4-manifolds. Journal of Topology 2008 1(3):703–745
  7. ^ Hass, Joel; Lagarias, Jeffrey C.; Pippenger, Nicholas (1999), The computational complexity of knot and link problems, Journal of the ACM 46 (2): 185–211, arXiv:math/9807016, doi:10.1145/301970.301971 .
  8. ^ "Main_Page", The Knot Atlas.
  9. ^ E H Brown's "Finite Computability of Postnikov Complexes" annals of Mathematics (2) 65 (1957) pp 1–20

External links[edit]

Books[edit]