ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Xn=(X1,…,Xn)X^n=(X_1,\ldots,X_n) be the block of Boolean observations, let Πn−k(Xn)\Pi_{n-k}(X^n) denote the Boolean threshold function, and suppose the probability distribution satisfies p1≤p2≤…≤pnp_1\leq p_2\leq\ldots\leq p_n. Optimal first transmission conjecture. In order to compute Πn−k(Xn)\Pi_{n-k}(X^n), it is optimal for node k+1k+1 to transmit first, using the Huffman code, for all nn and all 0≤k≤n−10\leq k\leq n-1. The conjecture proposes an optimal ordering for block computation under arbitrary interactive strategies and zero-error computation; its resolution is not given in the supplied text.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.