@article{3933e65aceb14f768a398d143f6ba219,
title = "Permutation reconstruction from a few large patterns",
abstract = "Every permutation of rank n ≥ 5 is reconstructible from any ⌈n/2⌉ + 2 of its (n − 1)-patterns.",
author = "Gouveia, {Maria Jo{\~a}o} and Erkko Lehtonen",
note = "Funding Information: ∗This work is funded by National Funds through the FCT – Funda¸c{\~a}o para a Ci{\^e}ncia e a Tecnologia, I.P., under the scope of the project UIDB/00297/2020 (Center for Mathematics and Applications) and the project PTDC/MAT-PUR/31174/2017. Funding Information: This work is funded by National Funds through the FCT ? Funda??o para a Ci?ncia e a Tecnologia, I.P., under the scope of the project UIDB/00297/2020 (Center for Mathematics and Applications) and the project PTDC/MAT-PUR/31174/2017. Publisher Copyright: {\textcopyright} The authors.",
year = "2021",
doi = "10.37236/10403",
language = "British English",
volume = "28",
journal = "Electronic Journal of Combinatorics",
issn = "1077-8926",
publisher = "Electronic Journal of Combinatorics",
number = "3",
}