On Sets Represented by Partitions


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. 
DOI: 10.1006/eujc.1999.0300


Cite this paper

@article{Aval1999OnSR, title={On Sets Represented by Partitions}, author={Jean-Christophe Aval}, journal={Eur. J. Comb.}, year={1999}, volume={20}, pages={317-320} }