The kappa inequalities for the finite-dimensional functional approach
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.
References
- Zijie Chen, Amin Gohari and Chandra Nair, “A Differential Equation Approach to the Most-Informative Boolean Function Conjecture”, arXiv:2502.10019 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.