ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let XX be uniformly distributed on {0,1}n\{0,1\}^n, let Y=BDC⁡d(X)Y=\operatorname{BDC}_d(X) be the output of the binary deletion channel with deletion probability dd, and let D(X,Y)\mathcal{D}(X,Y) be the set of length-nn strings compatible with XX and YY. Define

E∞=lim⁡n→∞1nElog⁡∣D(X,Y)∣.E_\infty=\lim_{n\to\infty}\frac{1}{n}\mathbb{E}\log|\mathcal{D}(X,Y)|.

Concentration conjecture, weak form. Almost surely,

1nlog⁡∣D(X,Y)∣⟶E∞.\frac{1}{n}\log|\mathcal{D}(X,Y)|\longrightarrow E_\infty.

This conjecture concerns the concentration of the normalized logarithm of the number of compatible inputs for a deletion-channel output. The paper notes that it may not be difficult to prove, while stronger concentration would provide more rigorous control of the simulation-based bounds.

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.