The simplified exponents-region conjecture for K-hop networks
Statement
Let , let be the link rates, and let be the type-I error thresholds at the decision centers. Let denote the fundamental type-II error-exponents region, and choose a permutation such that
with . For , define
Simplified exponents-region conjecture. The region is the set of all exponent tuples for which there exist nonnegative rates satisfying
and
The formula is obtained by retaining only the rate-sharing components indexed by the ordered decision centers; it is proved in the paper for and , whereas its validity for arbitrary is conjectured.
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.