3 problems

Let $\texttt{PINES}$ denote the polynomial-time procedure discussed in the paper, and consider the latent seriation problem in which its achieved rate is $n^{3/4}$. PINES rate conj…

Let $X$ be a general Toeplitz–Robinson matrix in the seriation problem, where the goal is to recover its latent ordering from noisy observations. Computational-statistical gap conj…

Structural constraint conjecture. The structure of the seriation problem imposes constraints on the number of admissible solutions: the admissible permutations are one half of thos…