Conjecture on convexity and concavity of the Arimoto information-combining bound
Statement
Let denote the Arimoto conditional-entropy function and let denote binary convolution. There exists a value such that
is convex for and concave for . This conjecture is based on numerical evidence; the stated threshold is bounded by verified counterexamples and additional numerical observations, while the behavior beyond is not asserted.
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.