Mostrar el registro sencillo del ítem

Artículo

dc.creatorChappelon, Jonathanes
dc.creatorRevuelta Marchena, María Pastoraes
dc.creatorSanz Domínguez, María Isabeles
dc.date.accessioned2022-09-01T09:35:23Z
dc.date.available2022-09-01T09:35:23Z
dc.date.issued2013
dc.identifier.citationChappelon, J., Revuelta Marchena, M.P. y Sanz Domínguez, M.I. (2013). Modular Schur numbers. The Electronic Journal of Combinatorics, 20 (2)
dc.identifier.issn1077-8926es
dc.identifier.urihttps://hdl.handle.net/11441/136597
dc.description.abstractFor 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.formatapplication/pdfes
dc.format.extent26es
dc.language.isoenges
dc.publisherElectronic Journal of Combinatoricses
dc.relation.ispartofThe Electronic Journal of Combinatorics, 20 (2)
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectModular Schur numberses
dc.subjectSchur numberses
dc.subjectSum-free setses
dc.subjectWeakly sum-free setses
dc.titleModular Schur numberses
dc.typeinfo:eu-repo/semantics/articlees
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)es
dc.relation.publisherversionhttps://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p61es
dc.identifier.doi10.37236/2374es
dc.contributor.groupUniversidad de Sevilla. FQM-164: Matemática Discreta: Teoría de Grafos y Geometría Computacionales
dc.journaltitleThe Electronic Journal of Combinatoricses
dc.publication.volumen20es
dc.publication.issue2es
dc.identifier.sisius20910815es

FicherosTamañoFormatoVerDescripción
2374-PDF file-7118-1-10-201306 ...391.4KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional