On sets represented by partitions

被引：3

作者：

Aval, JC ^{[1
]}

机构：

[1] Univ Bordeaux 1, Lab A2X, F-33405 Talence, France

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 1999年 / 20卷 / 05期

关键词：

D O I：

10.1006/eujc.1999.0300

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove a lemma that is useful for obtaining upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts) partitions of an integer n. (C) 1999 Academic Press.

引用

页码：317 / 320

页数：4