Geometric Embeddability of Complexes is ∃ℝ-complete

08/05/2021
by   Mikkel Abrahamsen, et al.
0

We show that the decision problem of determining whether a given (abstract simplicial) k-complex has a geometric embedding in ℝ^d is complete for the Existential Theory of the Reals for all d≥ 3 and k∈{d-1,d}. This implies that the problem is polynomial time equivalent to determining whether a polynomial equation system has a real solution. Moreover, this implies NP-hardness and constitutes the first hardness results for the algorithmic problem of geometric embedding (abstract simplicial) complexes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/28/2013

The Complexity of Simultaneous Geometric Graph Embedding

Given a collection of planar graphs G_1,...,G_k on the same set V of n v...
research
01/09/2023

Representing Matroids over the Reals is ∃ℝ-complete

A matroid M is an ordered pair (E,I), where E is a finite set called the...
research
02/19/2021

Training Neural Networks is ER-complete

Given a neural network, training data, and a threshold, it was known tha...
research
01/18/2018

A universality theorem for allowable sequences with applications

Order types are a well known abstraction of combinatorial properties of ...
research
07/21/2022

On Hardness of Testing Equivalence to Sparse Polynomials Under Shifts

We say that two given polynomials f, g ∈ R[X], over a ring R, are equiva...
research
12/19/2019

On the hardness of finding normal surfaces

There are fundamental topological problems, such as unknot recognition a...
research
03/12/2018

Dedekind Zeta Zeroes and Faster Complex Dimension Computation

Thanks to earlier work of Koiran, it is known that the truth of the Gene...

Please sign up or login with your details

Forgot password? Click here to reset