ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let a sum-network have m=n=3m=n=3, where mm is the number of sources and nn is the number of terminals, and let its capacity be the supremum of the achievable communication rates for computing the sum of the source messages at every terminal.

Capacity trichotomy conjecture. The capacity of the sum-network is either 00, 2/32/3, or at least 11.

The preceding discussion gives examples and structural observations supporting this classification, but the statement is presented as a belief rather than established here. No resolution is supplied in the source.

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.