Permutation reconstruction from a few large patterns
Gouveia, M. J.; Lehtonen, Erkko
Electronic Journal of Combinatorics, 28(3) (2021), #P3.41
http://doi.org/10.37236/10403
Every permutation of rank n >= 5 is reconstructible from any ceiling(n/2) + 2 of its (n-1)-patterns.
|
