ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (Ω,S,B,μ)(\Omega,S,B,\mu) be a tree-indexed process. Define

f(n)=μn(πn(B))−1f(n)=\mu^n\bigl(\pi_n(B)\bigr)^{-1}

so that f(n)f(n) is the probability that a sequence of nn IID picks from μ\mu extends to some sequence in BB. The converse capacity conjecture. If P(Γ;B)>0P(\Gamma;B)>0, then

cap⁡‾f(Γ)>0.\overline{\operatorname{cap}}_f(\Gamma)>0.

If true, this would make the capacity criterion necessary and sufficient in the quasi-Bernoulli case, complementing the Basic Theorem; the conjecture is identified in the source as the most important open problem for tree-indexed processes.

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.