Permutation Reconstruction From a Few Large Patterns
Abstract
Every permutation of rank $n \geqslant 5$ is reconstructible from any $\lceil n / 2 \rceil + 2$ of its $(n-1)$-patterns.
Every permutation of rank $n \geqslant 5$ is reconstructible from any $\lceil n / 2 \rceil + 2$ of its $(n-1)$-patterns.