Reconstructing permutations from cycle minors
type: Item
instance of: scholarly article
title: Reconstructing permutations from cycle minors
zbMATH Open document ID: 1178.05001
published in: The Electronic Journal of Combinatorics
publication date: 2009-04-07T00:00:00Z
full work available at URL: https://eudml.org/doc/117301
full work available at URL: v16i1r19.html
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.
Mathematics Subject Classification ID: 05A05
zbMATH DE Number: 5541084
author: Maria Monks Gillespie
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 5541084