Polynomial-time conjecture for counting constrained linear extensions
Statement
Let be a finite poset with fixed prescribed values represented by , and let denote the number of linear extensions satisfying those prescriptions. Constrained linear-extension counting conjecture. For every fixed integer , the decision problem
is in . The source proves the case and conjectures the statement for every fixed .
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.