On sets represented by partitions
Aval, Jean-Christophe
HAL, hal-00185506 / Harvested from HAL
Text on HAL
We prove a lemma that is useful to get 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.
Publié le : 1999-07-05
Classification:  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00185506,
     author = {Aval, Jean-Christophe},
     title = {On sets represented by partitions},
     journal = {HAL},
     volume = {1999},
     number = {0},
     year = {1999},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00185506}
}

Aval, Jean-Christophe. On sets represented by partitions. HAL, Tome 1999 (1999) no. 0, . http://gdmltest.u-ga.fr/item/hal-00185506/