Reconstruction of permutations distorted by single transposition errors

Simple item page
dc.creatorKonstantinova, Elena
dc.creatorLevenshtein, Vladimir
dc.creatorSiemons, Johannes
dc.date2007-02-07
dc.date.accessioned2026-07-07T07:45:21Z
dc.date.available2026-07-07T07:45:21Z
dc.descriptionThe reconstruction problem for permutations on $n$ elements from their erroneous patterns which are distorted by transpositions is presented in this paper. It is shown that for any $n \geq 3$ an unknown permutation is uniquely reconstructible from 4 distinct permutations at transposition distance at most one from the unknown permutation. The {\it transposition distance} between two permutations is defined as the least number of transpositions needed to transform one into the other. The proposed approach is based on the investigation of structural properties of a corresponding Cayley graph. In the case of at most two transposition errors it is shown that $\frac32(n-2)(n+1)$ erroneous patterns are required in order to reconstruct an unknown permutation. Similar results are obtained for two particular cases when permutations are distorted by given transpositions. These results confirm some bounds for regular graphs which are also presented in this paper.
dc.description5 pages, Report of paper presented at ISIT-2007
dc.identifierhttps://arxiv.org/abs/math/0702191
dc.identifierhttp://arxiv.org/abs/math/0702191
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123503
dc.subjectCombinatorics
dc.subjectGroup Theory
dc.subject94A08, 05E30, 05C60
dc.titleReconstruction of permutations distorted by single transposition errors
dc.typetext

Files

Collections

arXiv