2 problems

Let $L$ be a lattice. It is completely uniquely paired if there is a unique bijection $\lambda:L\to L$ such that, for every $x\in L$, $\lambda(x)$ is maximal among the elements…

The countable width-two lattice decomposition conjecture. The lattice $L$ is semidistributive and