Quantitative lower bounds for trace reconstruction
Exact worst-case reconstruction of a binary word from independent deletion traces requires samples for every fixed deletion probability , even with unrestricted computation and any fixed positive success probability . More generally, along every sequence of instances with , , and , for any fixed and , eventually.
The proof is complete and mathematically rigorous. The channel reduction, scale margins, inductive construction, two-point testing, and posterior factorization for gadgets all hold under the stated hypotheses.
“Theorem 1.1 (Quantitative sample lower bound). Fix s ∈ (0, 1] and 0 < c < 1/(4 log 2). Along every sequence of instances (n, q) with n → ∞, q ∈ (0, 1), and q^3 log n → ∞, (n) ≥ (1.1) eventually. All logarithms are natural. In particular, for each fixed deletion probability q ∈ (0, 1) and fixed positive success probability s, the required sample number is .” · Show in paper