Permutation Reconstruction From a Few Large Patterns

  • Maria João Gouveia
  • Erkko Lehtonen
DOI: https://doi.org/10.37236/10403

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
How to Cite
Gouveia, M. J., & Lehtonen, E. (2021). Permutation Reconstruction From a Few Large Patterns. The Electronic Journal of Combinatorics, 28(3), P3.41. https://doi.org/10.37236/10403
Issue
Volume 28, Issue 3 (2021)
Article Number
P3.41