Mostrar el registro sencillo del ítem
On sets represented by partitions
hal.structure.identifier | Théorie des Nombres et Algorithmique Arithmétique [A2X] | |
hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
dc.contributor.author | AVAL, Jean-Christophe | |
dc.date.created | 1998 | |
dc.date.issued | 1999 | |
dc.identifier.issn | 0195-6698 | |
dc.description.abstractEn | 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. | |
dc.language.iso | en | |
dc.publisher | Elsevier | |
dc.title.en | On sets represented by partitions | |
dc.type | Article de revue | |
dc.subject.hal | Mathématiques [math]/Combinatoire [math.CO] | |
dc.identifier.arxiv | 0711.0897 | |
bordeaux.journal | European Journal of Combinatorics | |
bordeaux.page | 317-320 | |
bordeaux.volume | 20 | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-00185506 | |
hal.version | 1 | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-00185506v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=European%20Journal%20of%20Combinatorics&rft.date=1999&rft.volume=20&rft.spage=317-320&rft.epage=317-320&rft.eissn=0195-6698&rft.issn=0195-6698&rft.au=AVAL,%20Jean-Christophe&rft.genre=article |
Archivos en el ítem
Archivos | Tamaño | Formato | Ver |
---|---|---|---|
No hay archivos asociados a este ítem. |