ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers k,dk,d, let GEM⁡k→d\operatorname{GEM}_{k \rightarrow d} denote the decision problem of determining whether a given kk-complex has a geometric embedding in Rd\mathbb{R}^d. Skopenkov's conjecture. The problem GEM⁡k→d\operatorname{GEM}_{k \rightarrow d} is NP-hard for all k,dk,d satisfying

max⁡{3,k}≤d≤32k+1.\max\{3,k\} \leq d \leq \frac{3}{2}k+1.

Geometric embeddability is decidable for all k,dk,d because it can be expressed in the first-order theory of the reals. The conjectured NP-hardness extends the known complexity landscape for piecewise-linear embeddability, while the cited context identifies GEM⁡2→3\operatorname{GEM}_{2 \rightarrow 3} as an interesting open problem.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.