On sets represented by partitions

Jean-Christophe Aval (1, 2)

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

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.

Domaines: Combinatoire [math.CO]

Jean-Christophe Aval. On sets represented by partitions. European Journal of Combinatorics, 1999, 20, pp.317-320. ⟨hal-00185506⟩