Order, lattices, ordered algebraic structures Combinatorics of posets Concept
Order complex
Summary
The order complex of a partially ordered set is a simplicial complex with the elements of as vertices. Its faces are the finite chains of . It turns a poset into a topological space, its geometric realization. So one can speak of the homotopy type and the homology of a poset. This is the basis of poset topology. For example, take an open interval of a finite poset. By a theorem of Philip Hall, the reduced Euler characteristic of its order complex equals the value of the Möbius function on that interval. The order complex of the face poset of a simplicial complex is its barycentric subdivision.
Further reading
About this page
| Tag | J32951135H |
|---|---|
| URI | m2://J32951135H |
| Kind | concept |
| Writing | W0 stub |
| MSC | 06A07, 05E45, 55U10 |
| Changed | 2 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.