\magnification=1200
\hsize=4in
\overfullrule=0pt
\input amssym
%\def\frac#1 #2 {{#1\over #2}}
\def\emph#1{{\it #1}}
\def\em{\it}
\nopagenumbers
\noindent
%
%
{\bf Vincent Vatter}
%
%
\medskip
\noindent
%
%
{\bf A Sharp Bound for the Reconstruction of Partitions}
%
%
\vskip 5mm
\noindent
%
%
%
%
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.
\bye