Jump to content

Simplicial complex recognition problem

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Erel Segal (talk | contribs) at 06:38, 27 November 2022. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The simplicial complex recognition problem is a computational problem in algebraic topology. Given a simplicial complex, the problem is to decide whether it is homeomorphic to another fixed simplicial complex. The problem is undecidable for complexes of dimension 5 or more.[1][2]

Background

References

  1. ^ Stillwell, John (1993), Classical Topology and Combinatorial Group Theory, Graduate Texts in Mathematics, vol. 72, Springer, p. 247, ISBN 9780387979700.
  2. ^ Poonen, Bjorn (2014-10-25). "Undecidable problems: a sampler". arXiv:1204.0299 [math].
Retrieved from "https://en.wikipedia.org/w/index.php?title=Simplicial_complex_recognition_problem&oldid=1124080728"