Permutation Reconstruction From a Few Large Patterns

  • Maria João Gouveia
  • Erkko Lehtonen

Abstract

Every permutation of rank $n \geqslant 5$ is reconstructible from any $\lceil n / 2 \rceil + 2$ of its $(n-1)$-patterns.

Published
2021-08-27
Article Number
P3.41