ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Y=⟨P,≤⟩\textbf{Y}=\left\langle \mathcal P,\leq\right\rangle be Young's lattice, where P\mathcal P is the set of partitions ordered by inclusion of their Young diagrams. The Sigma-1 theory conjecture. The Σ1\Sigma_1-theory of Young's lattice Y=⟨P,≤⟩\textbf{Y}=\left\langle \mathcal P,\leq\right\rangle is NP\textbf{NP}-complete. The preceding discussion establishes that this theory is at least NP\textbf{NP}-hard if it is decidable; the conjecture asks for the matching upper bound. An affirmative answer would give an NP\textbf{NP}-characterization of the posets that embed in Young's lattice.

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.