On Sets Represented by Partitions

Author: Aval J-C.

Source: European Journal of Combinatorics, Volume 20, Number 5, July 1999 , pp. 317-320(4)

Publisher: Academic Press

Abstract:

We prove a lemma that is useful for obtaining 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 . Copyright 1999 Academic Press

Language: English

Document Type: Research article

Affiliations: Laboratoire A2X, Université de Bordeaux 1, 351 cours de la Libération, Talence Cedex, F-33405, France

Publication date: 1999-07-01

• In this: publication
• By this: publisher
• In this Subject: Mathematics and Statistics
• By this author: Aval J-C.

Website © Publishing Technology. Article copyright remains with the publisher, society or author(s) as specified within the article.

• Terms and conditions
• Privacy policy
• Information for advertisers