Reconstructing permutations from cycle minors

MaRDI QIDQ1010923zbMATH OpenFDO

Authors Maria Monks Gillespie

Publication date 7 April 2009

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/117301, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r19.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Review text

Summary: The \(i\)th cycle minor of a permutation \(p\) of the set \(\{1,2,\dots,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,\dots,n\}\) can be reconstructed from its set of cycle minors if and only if \(n\geq 6\). We then use this to provide an alternate proof of a known result on a related reconstruction problem.

Recommendations

• Permutation reconstruction from minors
• Reconstructing permutations from identification minors
• Permutation reconstruction
• Determining a permutation from its set of reductions.
• Permutation reconstruction from a few large patterns

Cited in

(7)

• The solution to the partition reconstruction problem
• Permutation reconstruction from minors
• Permutation reconstruction from differences
• Determining a permutation from its set of reductions.
• Young tableau reconstruction via minors
• Improvements on permutation reconstruction from minors
• Reconstructing permutations from identification minors

This page was built for publication: Reconstructing permutations from cycle minors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010923)