The NP-completeness conjecture for the Sigma-1 theory of Young's lattice
Statement
Let be Young's lattice, where is the set of partitions ordered by inclusion of their Young diagrams. The Sigma-1 theory conjecture. The -theory of Young's lattice is -complete. The preceding discussion establishes that this theory is at least -hard if it is decidable; the conjecture asks for the matching upper bound. An affirmative answer would give an -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.