Geodesic
Reconstructing permutations from cycle minors
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The $i$th cycle minor of a permutation $p$ of the set $\{1,2,\ldots,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,\ldots,n\}$ can be reconstructed from its set of cycle minors if and only if $n\ge 6$. We then use this to provide an alternate proof of a known result on a related reconstruction problem.
DOI : 10.37236/108
Classification : 05A05 
@article{10_37236_108,
     author = {Maria Monks},
     title = {Reconstructing permutations from cycle minors},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/108},
     zbl = {1178.05001},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/108/}
}
TY  - JOUR
AU  - Maria Monks
TI  - Reconstructing permutations from cycle minors
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/108/
DO  - 10.37236/108
ID  - 10_37236_108
ER  - 
%0 Journal Article
%A Maria Monks
%T Reconstructing permutations from cycle minors
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/108/
%R 10.37236/108
%F 10_37236_108
Maria Monks. Reconstructing permutations from cycle minors. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/108

Cité par Sources :