Reconstruction of partitions
The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2
For the partition $x=[x_1\ge x_2\ge \cdots\ge x_k]$ of the integer $n=\sum_{i}\, x_{i}$ a $t$-deletion is a partition $y=[y_1\ge y_2\ge \cdots\ge y_k]$ with $x_{i}\geq y_{i}\geq 0$ and $\sum_{i}\, (x_{i}-y_{i})=t$. We prove that all partitions of $n$ are reconstructible from their $t$–deletions if $n$ is sufficiently large in relation to $t$.
@article{10_37236_1892,
author = {Oliver Pretzel and Johannes Siemons},
title = {Reconstruction of partitions},
journal = {The electronic journal of combinatorics},
year = {2004},
volume = {11},
number = {2},
doi = {10.37236/1892},
zbl = {1077.05009},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1892/}
}
Oliver Pretzel; Johannes Siemons. Reconstruction of partitions. The electronic journal of combinatorics, The Stanley Festschrift volume, Tome 11 (2004) no. 2. doi: 10.37236/1892
Cité par Sources :