The kappa inequalities for the finite-dimensional functional approach
Statement
For , define
with . The kappa inequalities. The following two assertions hold: for , ; and the function is jointly convex. These inequalities would yield the lower bound needed to prove that , and hence would imply the balanced case of the most-informative Boolean function conjecture. They are supported by numerical evidence but are not proved in the paper.
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.