分划重构的一个锐界
A sharp bound for the reconstruction of partitions
摘要：
Cameron，Pretzel和Siemons提出的一个问题证明了$n\ge 2(k+3)(k+1)$的每一个整数划分都可以从它的$k$ -缺失集合中重建出来。我们描述了一种新的重建算法，降低这一界限$n\ge k^2+2k$和目前的例子表明，这一界限是最好的可能。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
