Permutation reconstruction from a few large patterns

Every permutation of rank n ≥ 5 is reconstructible from any ⌈n/2⌉ + 2 of its (n − 1)-patterns.

Bibliographic Details
Main Author: Gouveia, Maria João (author)
Other Authors: Lehtonen, Erkko (author)
Format: article
Language:eng
Published: 2022
Subjects:
Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics
Online Access:http://hdl.handle.net/10362/131754
Country:Portugal
Oai:oai:run.unl.pt:10362/131754
Description
Summary:Every permutation of rank n ≥ 5 is reconstructible from any ⌈n/2⌉ + 2 of its (n − 1)-patterns.

Similar Items