Permutation reconstruction from a few large patterns

Maria João Gouveia, Erkko Lehtonen

Research output: Contribution to journalArticlepeer-review

1 Downloads (Pure)

Abstract

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

Original languageEnglish
Article numberP3.41
JournalElectronic Journal Of Combinatorics
Volume28
Issue number3
DOIs
Publication statusPublished - 27 Aug 2021

Fingerprint

Dive into the research topics of 'Permutation reconstruction from a few large patterns'. Together they form a unique fingerprint.

Cite this