Reconstructing Permutations from Cycle Minors
Name
Monks-2009-Reconstructing permutations.pdf
Size
101.98 KB
Format
Adobe PDF
Checksum (MD5)
8f874436e7ca708528b6a68efa33ea46
Author(s)
Monks, Maria
Date Issued
February 2009
Journal
Electronic Journal of Combinatorics
Publisher
Electronic Journal of Combinatorics
Citation
Monks, Maria. "Reconstructing Permutations from Cycle Minors." Electronic Journal of Combinatorics, Volume 16, Issue 1 (2009).
Version
Final published version
Abstract
The ith cycle minor of a permutation p of the set {1,2,…,n} is the permutation formed by deleting an entry i from the decomposition of p into disjoint cycles and reducing each remaining entry larger than i by 1. In this paper, we show that any permutation of {1,2,…,n} can be reconstructed from its set of cycle minors if and only if n≥6. We then use this to provide an alternate proof of a known result on a related reconstruction problem.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.37236/108
