ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a partially fixed-size network, let k1k_1 be the default alphabet size for default-size messages and k2k_2 the default alphabet size for default-size edges. Let k1∗(k2)k_1^*(k_2) be the largest possible k1k_1 for fixed k2k_2 such that the network admits a coding scheme, and define its asymptotic capacity by

lim sup⁡k2→∞log⁡k1∗(k2)log⁡k2.\underset{k_2\to\infty}{\limsup}\frac{\log k_1^*(k_2)}{\log k_2}.

Asymptotic-capacity undecidability conjecture. The following problem is undecidable: given a partially fixed-size network (V,E,{Av},{Bv},sM,sE)(V,E,\{A_v\},\{B_v\},s_M,s_E), decide whether its asymptotic capacity is at least 11. This is proposed as a future direction; the source gives no resolution or supporting reduction beyond stating the conjecture.

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.