Reconstruction of partitions

被引：0

作者：

Pretzel, O

Siemons, J

机构：

[1] Univ London Imperial Coll Sci Technol & Med, Dept Math, London SW7 2AZ, England

[2] Univ E Anglia, Sch Math, Norwich NR4 7TJ, Norfolk, England

来源：

ELECTRONIC JOURNAL OF COMBINATORICS | 2005年 / 11卷 / 02期

关键词：

partitions; reconstruction;

D O I：

暂无

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

For the partition x = [x(1) >= x(2) >=...>= x(k)] of the integer n = Sigma(i) x(i) a t-deletion is a partition y = [y(1) >= y(2) >=...>= y(k)] with x(i) >= y(i) >= 0 and Sigma(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.

引用

页数：6