dc.creator | Chappelon, Jonathan | es |
dc.creator | Revuelta Marchena, María Pastora | es |
dc.creator | Sanz Domínguez, María Isabel | es |
dc.date.accessioned | 2022-09-01T09:35:23Z | |
dc.date.available | 2022-09-01T09:35:23Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Chappelon, J., Revuelta Marchena, M.P. y Sanz Domínguez, M.I. (2013). Modular Schur numbers. The Electronic Journal of Combinatorics, 20 (2) | |
dc.identifier.issn | 1077-8926 | es |
dc.identifier.uri | https://hdl.handle.net/11441/136597 | |
dc.description.abstract | For any positive integers l and m, a set of integers is said to be (weakly) l-sum free modulo m if it contains no (pairwise distinct) elements x1, x2, . . . , xl
, y satisfying
the congruence x1 + . . . + xl ≡ y mod m. It is proved that, for any positive integers
k and l, there exists a largest integer n for which the set of the first n positive
integers {1, 2, . . . , n} admits a partition into k (weakly) l-sum-free sets modulo m.
This number is called the generalized (weak) Schur number modulo m, associated
with k and l. In this paper, for all positive integers k and l, the exact value of these
modular Schur numbers are determined for m = 1, 2 and 3. | es |
dc.format | application/pdf | es |
dc.format.extent | 26 | es |
dc.language.iso | eng | es |
dc.publisher | Electronic Journal of Combinatorics | es |
dc.relation.ispartof | The Electronic Journal of Combinatorics, 20 (2) | |
dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Modular Schur numbers | es |
dc.subject | Schur numbers | es |
dc.subject | Sum-free sets | es |
dc.subject | Weakly sum-free sets | es |
dc.title | Modular Schur numbers | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/publishedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) | es |
dc.relation.publisherversion | https://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p61 | es |
dc.identifier.doi | 10.37236/2374 | es |
dc.contributor.group | Universidad de Sevilla. FQM-164: Matemática Discreta: Teoría de Grafos y Geometría Computacional | es |
dc.journaltitle | The Electronic Journal of Combinatorics | es |
dc.publication.volumen | 20 | es |
dc.publication.issue | 2 | es |
dc.identifier.sisius | 20910815 | es |