ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A triangulation T\mathcal{T} is a finite triangulation of a closed 3-manifold, and S3S^3 recognition asks whether T\mathcal{T} triangulates the 3-sphere. The complexity class coNP⁡\operatorname{coNP} consists of decision problems whose complements lie in NP. The coNP conjecture for three-sphere recognition. S3S^3 recognition lies in coNP⁡\operatorname{coNP}. The preceding theorem establishes that S3S^3 recognition lies in NP, while the complementary coNP membership remains open in the source.

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.