ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let S⊆[n]×[n]S\subseteq [n]\times[n]. Define the decision problem CONVEX\texttt{CONVEX} to output TRUE if the projection πS(SO⁡(n))\pi_S(\operatorname{SO}(n)) is convex, and FALSE otherwise. NP-hardness conjecture. The problem CONVEX\texttt{CONVEX} is NP-hard. This conjecture concerns the computational complexity of characterizing which coordinate projections of SO⁡(n)\operatorname{SO}(n) are convex. The paper gives a complete characterization for coordinate subsets of [4]×[4][4]\times[4], up to permutations and transposition, but the general complexity remains open.

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.