On sets represented by partitions
classification
🧮 math.CO
keywords
partitionsnumberrepresentedsetsupperboundboundsdeduce
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.