Geodesic
A sharp bound for the reconstruction of partitions
The electronic journal of combinatorics, Tome 15 (2008)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Answering a question of Cameron, Pretzel and Siemons proved that every integer partition of $n\ge 2(k+3)(k+1)$ can be reconstructed from its set of $k$-deletions. We describe a new reconstruction algorithm that lowers this bound to $n\ge k^2+2k$ and present examples showing that this bound is best possible.
DOI : 10.37236/898
Classification : 05A17, 05C60, 06A07
Mots-clés : reconstruction algorithm, reconstruction of partitions, k-deletions 
@article{10_37236_898,
     author = {Vincent Vatter},
     title = {A sharp bound for the reconstruction of partitions},
     journal = {The electronic journal of combinatorics},
     year = {2008},
     volume = {15},
     doi = {10.37236/898},
     zbl = {1160.05306},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/898/}
}
TY  - JOUR
AU  - Vincent Vatter
TI  - A sharp bound for the reconstruction of partitions
JO  - The electronic journal of combinatorics
PY  - 2008
VL  - 15
UR  - http://geodesic.mathdoc.fr/articles/10.37236/898/
DO  - 10.37236/898
ID  - 10_37236_898
ER  - 
%0 Journal Article
%A Vincent Vatter
%T A sharp bound for the reconstruction of partitions
%J The electronic journal of combinatorics
%D 2008
%V 15
%U http://geodesic.mathdoc.fr/articles/10.37236/898/
%R 10.37236/898
%F 10_37236_898
Vincent Vatter. A sharp bound for the reconstruction of partitions. The electronic journal of combinatorics, Tome 15 (2008). doi: 10.37236/898

Cité par Sources :