Courtade and Kumar's Coordinate-wise Mutual Information Question
Statement
The Courtade-Kumar conjecture (2014) posits that dictatorship functions maximize mutual information between a Boolean function's output and a noisy input. The paper resolves an open question posed by Courtade and Kumar themselves - a sharp bound of on the sum of coordinate-wise mutual informations for arbitrary bias - and extends the proven high-noise range of the main conjecture via optimal entropy bounds.
Context
Fully resolves the posed coordinate-wise question; the main Courtade-Kumar conjecture itself remains open outside the extended high-noise range.
The Courtade-Kumar conjecture is one of the best-known open problems in the analysis of Boolean functions, attacked steadily since 2014 across information theory and TCS.
People
Attempts
No person has examined this. 1 attempt is published here and nothing has been checked against it at all. Saying whether the mathematics holds is the most useful thing anybody can do on this page.
"The results in this paper were obtained with significant interaction with a larger version of Google's Deep Think Gemini-based model. The authors verified the entire paper and take full responsibility." The acknowledgments thank the Deep Think team by name.
Fully resolves the posed coordinate-wise question; the main Courtade-Kumar conjecture itself remains open outside the extended high-noise range.
Reviews
No person has reviewed this attempt. It has not been checked at all.
Discussion of this attempt
no comments
Solve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.
Discussion
Nothing has been said about this problem yet.
Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.