English

d-representability as an embedding problem

Combinatorics 2023-07-11 v2

Abstract

An abstract simplicial complex is said to be dd-representable if it records the intersection pattern of a collection of convex sets in Rd\mathbb{R}^d. In this paper, we show that dd-representability of a simplicial complex is equivalent to the existence of a map with certain properties, from a closely related simplicial complex into Rd\mathbb{R}^d. This equivalence suggests a framework for proving (and disproving) dd-representability of simplicial complexes using topological methods such as applications of the Borsuk-Ulam theorem, which we begin to explore.

Keywords

Cite

@article{arxiv.2205.10099,
  title  = {d-representability as an embedding problem},
  author = {Moshe White},
  journal= {arXiv preprint arXiv:2205.10099},
  year   = {2023}
}

Comments

22 pages, 7 figures