4 problems

Let $N(n,3,t)$ denote the sequence reconstruction number for length-$n$ sequences over a binary deletion channel with three deletions and trace length parameter $t$, and let…

Extremal intersection conjecture. For $q\geqslant 4$ and sufficiently large $n$, we have

Let $\Sigma_q$ be an alphabet of size $q$, let $\mathcal{D}_t$ denote the deletion channel allowing $t$ deletions, and let $\rho(n,q,M;\mathcal{B})$ be the minimum size of an…

Let $N(n,\ell,t)$ denote the minimum number of traces of length $t$ needed to reconstruct every binary sequence of length $n$ with deletion distance parameter $\ell$, as defined in…