A sharp bound for the reconstruction of partitions
| dc.creator | Vatter, Vincent | |
| dc.date | 2008-06-23 | |
| dc.date.accessioned | 2026-07-07T09:46:12Z | |
| dc.date.available | 2026-07-07T09:46:12Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0806.3739 | |
| dc.identifier | http://arxiv.org/abs/0806.3739 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/163448 | |
| dc.subject | Combinatorics | |
| dc.title | A sharp bound for the reconstruction of partitions | |
| dc.type | text |