@article{e12acfaf730945468ed6fc6e5a3a0945,
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 = "info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F00297%2F2020/PT# info:eu-repo/grantAgreement/FCT/6817 - DCRRNI ID/UIDB%2F00297%2F2020/PT# info:eu-repo/grantAgreement/FCT/3599-PPCDT/PTDC%2FMAT-PUR%2F31174%2F2017/PT# ",
year = "2021",
month = aug,
day = "27",
doi = "10.37236/10403",
language = "English",
volume = "28",
journal = "Electronic Journal Of Combinatorics",
issn = "1077-8926",
publisher = "American Mathematical Society",
number = "3",
}