On sets represented by partitions
AVAL, Jean-Christophe
Théorie des Nombres et Algorithmique Arithmétique [A2X]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Théorie des Nombres et Algorithmique Arithmétique [A2X]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
AVAL, Jean-Christophe
Théorie des Nombres et Algorithmique Arithmétique [A2X]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
< Reduce
Théorie des Nombres et Algorithmique Arithmétique [A2X]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Language
en
Article de revue
This item was published in
European Journal of Combinatorics. 1999, vol. 20, p. 317-320
Elsevier
English Abstract
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 ...Read more >
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.Read less <
Origin
Hal imported