Work

On sets represented by partitions

Year: 2007

Type: article

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.

Source: HAL (Le Centre pour la Communication Scientifique Directe)

DOI: 10.48550/arxiv.0711.0897

Author: Aval, Jean-Christophe

Institution: Laboratoire Bordelais de Recherche en Informatique

Language: English

Topic: Advanced Combinatorial Mathematics

Subfield: Discrete Mathematics and Combinatorics

Field: Mathematics

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4298053736

FWCI:

Cites:

Cited by:

Related to: 10