On sets represented by partitions
Combinatorics
2007-11-07 v1
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.
Cite
@article{arxiv.0711.0897,
title = {On sets represented by partitions},
author = {Jean-Christophe Aval},
journal= {arXiv preprint arXiv:0711.0897},
year = {2007}
}