d-representability as an embedding problem
Moshe White

TL;DR
This paper establishes an equivalence between d-representability of simplicial complexes and the existence of certain maps into R^d, providing a new topological framework for analyzing intersection patterns of convex sets.
Contribution
It introduces a novel equivalence linking d-representability to map existence, enabling topological methods to study intersection patterns of convex sets.
Findings
Equivalence between d-representability and specific map existence.
Framework for using topological tools like Borsuk-Ulam theorem.
Potential to prove or disprove d-representability using topology.
Abstract
An abstract simplicial complex is said to be -representable if it records the intersection pattern of a collection of convex sets in . In this paper, we show that -representability of a simplicial complex is equivalent to the existence of a map with certain properties, from a closely related simplicial complex into . This equivalence suggests a framework for proving (and disproving) -representability of simplicial complexes using topological methods such as applications of the Borsuk-Ulam theorem, which we begin to explore.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopological and Geometric Data Analysis · Homotopy and Cohomology in Algebraic Topology · Constraint Satisfaction and Optimization
