A finite entropic coupling calculus with forest and even-cycle certificates
Statement
Entropy proof of Sidorenko
There is a proof system for graph homomorphism inequalities using flag algebras.
Define a proof system for graph homomorphism inequalities using entropy.
Record
- Source
- Added
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.