On sets represented by partitions

Simple item page
dc.creatorAval, Jean-Christophe
dc.date2007-11-06
dc.date.accessioned2026-07-07T08:41:01Z
dc.date.available2026-07-07T08:41:01Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/0711.0897
dc.identifierhttp://arxiv.org/abs/0711.0897
dc.identifierEuropean Journal of Combinatorics 20 (1999) 317-320
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141549
dc.subjectCombinatorics
dc.titleOn sets represented by partitions
dc.typetext

Files

Collections

arXiv