Convexity conjecture for the hypergraph-based polynomial f_d
Statement
Let be integers, let be the polynomial
and let be the simplex on which it is defined. Convexity conjecture. The polynomial is convex over the simplex . This conjecture would give a positive answer to the question of whether attains its minimum on at the barycenter, since a convex function with the relevant symmetry has that property. The source provides no resolution of the conjecture.
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.