Conjecture on the order-complex structure of pure diagrams
Statement
Let be the finite poset of pure diagrams between and , and let be its order complex, whose faces are chains in . Regard this complex geometrically in the vector space by sending each poset element to its pure diagram. Order-complex conjecture. Any non-negative linear combination of pure diagrams is a non-negative linear combination of pure diagrams from one chain; equivalently, the convex hull of equals the geometric realization of . This conjecture asserts that the convex hull is assembled from simplices indexed by chains in the pure-diagram poset. The supplied text gives no resolution status.
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.