d-Representability of simplicial complexes of fixed dimension

Abstract

Let K be a simplicial complex with vertex set V = v1,..., vn. The complex K is d-representable if there is a collection C1,...,Cn of convex sets in Rd such that a subcollection Ci1,...,Cij has a nonempty intersection if and only if vi1,...,vij is a face of K. In 1967 Wegner proved that every simplicial complex of dimension d is (2d+1)-representable. He also suggested that his bound is the best possible, i.e., that there are d-dimensional simplicial complexes which are not 2d-representable. However, he was not able to prove his suggestion. We prove that his suggestion was indeed right. Thus we add another piece to the puzzle of intersection patterns of convex sets in Euclidean space.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…