A sharp bound for the reconstruction of partitions

Details A sharp bound for the reconstruction of partitions A sharp bound for the reconstruction of partitions

2008-06-23

arxiv.org/abs/0806.3739v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A sharp bound for the reconstruction of partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A sharp bound for the reconstruction of partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sharp bound for the reconstruction of partitions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-674325