On sets represented by partitionsReport as inadecuate

On sets represented by partitions - Download this document for free, or read online. Document in PDF available to download.

1 A2X - Théorie des Nombres et Algorithmique Arithmétique 2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

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 parts partitions of an integer n.

Author: Jean-Christophe Aval -

Source: https://hal.archives-ouvertes.fr/


Related documents