Conjecture that the monochromatic-box matrix is positive semidefinite
Statement
Let be the integer matrix whose rows and columns are indexed by all maps , with -entry
Positive-semidefiniteness conjecture. is positive semidefinite for . The matrix is positive semidefinite in the cases considered computationally, enabling convex programming methods, but the assertion for all remains open.
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.