ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A 2-hypergraph is a hypergraph whose hyperedges have size two, and PL realizability in Rd\mathbb R^d means realizability by a piecewise-linear representation in Rd\mathbb R^d. The PL realizability conjecture. (a) Deciding whether a 2-hypergraph is PL realizable in R3\mathbb R^3 is NP-complete. (b) Deciding whether a 2-hypergraph is PL realizable in R4\mathbb R^4 is decidable. The supplied text is corrupted and does not identify this passage as a conjecture or provide enough reliable context to determine its intended status.

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.