On the Complexity of Recognizing Nerves of Convex Sets
Abstract: We study the problem of recognizing whether a given abstract simplicial complex K is the k-skeleton of the nerve of j-dimensional convex sets in Rd. We denote this problem by R(k, j, d). As a main contribution, we unify the results of many previous works under this framework and show that many of these works in fact imply stronger results than explicitly stated. This allows us to settle the complexity status of R(1, j, d), which is equivalent to the problem of recognizing intersection graphs of j-dimensional convex sets in Rd, for any j and d. Furthermore, we point out some trivial cases of R(k, j, d), and demonstrate that R(k, j, d) is ER-complete for j in {d - 1, d} and k ≥ d.. https://www.cgt-journal.org/index.php/cgt/article/view/40
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
On the Complexity of Recognizing Nerves of Convex Sets ; volume:3 ; number:2 ; year:2024
Computing in Geometry and Topology ; 3, Heft 2 (2024)
- Creator
- DOI
-
10.57717/cgt.v3i2.40
- URN
-
urn:nbn:de:101:1-2023120223311261028302
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:37 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Schnider, Patrick
- Weber, Simon