Mathematics – Combinatorics
Scientific paper
2007-11-06
European Journal of Combinatorics 20 (1999) 317-320
Mathematics
Combinatorics
Scientific paper
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.
No associations
LandOfFree
On sets represented by partitions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On sets represented by partitions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On sets represented by partitions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-134648