Reconstructing Permutations from Cycle Minors
Author(s)
Monks, Maria
DownloadMonks-2009-Reconstructing permutations.pdf (101.9Kb)
PUBLISHER_POLICY
Publisher Policy
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.
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2009-02Department
Massachusetts Institute of Technology. Department of MathematicsJournal
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
ISSN
1077-8926