A sharp bound for the reconstruction of partitions (Q1010680)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A sharp bound for the reconstruction of partitions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A sharp bound for the reconstruction of partitions |
scientific article |
Statements
A sharp bound for the reconstruction of partitions (English)
0 references
7 April 2009
0 references
Summary: Answering a question of \textit{P.J. Cameron} [''Stories from the age of reconstruction,'' Congr. Numerantium 113, 31--41 (1996; Zbl 0895.05044)], \textit{O. Pretzel} and \textit{J. Siemons} [''Reconstruction of partitions,'' Electron. J. Comb. 11, No.\,2, Res. Pap. N5 (2004--2005; Zbl 1077.05009)] proved that every integer partition of \(n\geq 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\geq k^2+2k\) and present examples showing that this bound is best possible.
0 references
reconstruction algorithm
0 references
reconstruction of partitions
0 references
k-deletions
0 references
0.8670236468315125
0 references
0.8286899924278259
0 references
0.8273332715034485
0 references
0.7781452536582947
0 references
0.7280855178833008
0 references
