5 problems

Let $X$ and $Y$ be correlated binary strings of blocklength $n$, with correlation parameter $\rho$, and let $A_n,B_n\subset\{0,1\}^n$ satisfy … for fixed $0<\alpha,\beta<1$. Define…

Doubling-factor conjecture. Under this supposition, $Q_d(ff)$ is an isometric subgraph of $Q_d$.

Ilić–Klavžar–Rho conjecture. For every bad binary string $f$,

Index-invariance conjecture. If $f,f'$ are a non-trivial pair such that

Forbidden-word length conjecture. If $f,f'$ are a non-trivial pair such that