A Sharp Bound for the Reconstruction of Partitions
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.
2017 ◽
Vol E100.A
(3)
◽
pp. 761-768
◽
2015 ◽
Vol 74
(20)
◽
pp. 1793-1801
2010 ◽
Vol 30
(7)
◽
pp. 1844-1846
◽
2013 ◽
Vol 32
(12)
◽
pp. 3357-3360
2020 ◽
Vol 16
(2)
◽
pp. 156-163
2020 ◽
Vol 16
(3)
◽
pp. 262-272