A sharp bound for the reconstruction of partitions
Combinatorics
2008-06-24 v1
Abstract
Answering a question of Cameron, Pretzel and Siemons proved that every integer partition of can be reconstructed from its set of -deletions. We describe a new reconstruction algorithm that lowers this bound to and present examples showing that this bound is best possible.
Cite
@article{arxiv.0806.3739,
title = {A sharp bound for the reconstruction of partitions},
author = {Vincent Vatter},
journal= {arXiv preprint arXiv:0806.3739},
year = {2008}
}