Jump to content

Simplicial complex recognition problem

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Erel Segal (talk | contribs) at 06:37, 27 November 2022 (←Created page with '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. == Background == == References == {{reflist}} Category:Undecidable problems Category:Simplicial sets'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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.

Background

References

Retrieved from "https://en.wikipedia.org/w/index.php?title=Simplicial_complex_recognition_problem&oldid=1124080632"