A sharp bound for the reconstruction of partitions (Q1010680)

Summary: Answering a question of \textit{P.J. Cameron} [''Stories from the age of reconstruction,'' Congr. Numerantium 113, 31--41 (1996; Zbl 0895.05044)], \textit{O. Pretzel} and \textit{J. Siemons} [''Reconstruction of partitions,'' Electron. J. Comb. 11, No.\,2, Res. Pap. N5 (2004--2005; Zbl 1077.05009)] proved that every integer partition of \(n\geq 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\geq k^2+2k\) and present examples showing that this bound is best possible.