English

Modular Schur numbers

Combinatorics 2013-06-25 v1 Number Theory

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,yx_1,x_2,...,x_l,y satisfying the congruence x1+.˙.+xlymodmx_1+\...+x_l\equiv y\bmod{m}. It is proved that, for any positive integers k and l, there exists a largest integer nn for which the set of the first nn positive integers {1,2,.˙.,n}\{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 mm, 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.

Keywords

Cite

@article{arxiv.1306.5635,
  title  = {Modular Schur numbers},
  author = {Jonathan Chappelon and María Pastora Revuelta Marchena and María Isabel Sanz Domínguez},
  journal= {arXiv preprint arXiv:1306.5635},
  year   = {2013}
}

Comments

25 pages, 3 tables

R2 v1 2026-06-22T00:39:15.592Z