Math 2.0

Convex and discrete geometry Polytopes and polyhedra Concept

Abstract polytope

Summary

An abstract polytope is a partially ordered set that behaves like the set of faces of a polytope ordered by inclusion. It keeps only the incidence pattern of vertices, edges and higher faces and forgets all geometry. The axioms ask for a grading by dimension, a connectedness condition, and the diamond condition. The diamond condition says that between two faces whose dimensions differ by two there are exactly two faces. Abstract polytopes include the face lattices of convex polytopes, but also tilings and objects such as the hemicube that no convex polytope realises.

Further reading

  1. Web https://en.wikipedia.org/wiki/Abstract_polytope
About this page
TagWREPDZG7PF
URIm2://WREPDZG7PF
Kindconcept
WritingW0 stub
MSC52B15, 51M20, 06A07
SpecializesGraded poset
Same as

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.

What links here

Definitions