The Markov-chain extension of the most-informative Boolean function conjecture
Statement
Let , let be obtained by passing through a binary symmetric channel with crossover probability , and let be binary with forming a Markov chain. Define binary convolution by
and let be the inverse of binary entropy. The Markov-chain extension conjecture. One has
This extension preserves the degraded-channel structure and would provide a stronger route to the original conjecture. The paper gives no proof and treats it as 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.