Entropicity conjecture for polymatroids satisfying Ingleton and strong union inequalities
Statement
Let be a polymatroid function on a lattice. The entropicity conjecture. If satisfies all Ingleton inequalities and all strong union inequalities, then is entropic. The conjecture is motivated by computer experiments and would characterize entropic polymatroid functions using these two classes of inequalities; the supplied text gives no resolution.
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.