Modular Schur numbers

MaRDI QIDQ396788zbMATH OpenFDO

Authors Jonathan Chappelon, M. P. Revuelta, M. I. Sanz

Publication date 14 August 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1306.5635, http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i2p61

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

modular Schur numbersSchur numberssum-free setsweak Schur numbersweakly sum-free sets

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Generalized Ramsey theory (05C55) Ramsey theory (05D10) Congruences; primitive roots; residue systems (11A07) Elementary theory of partitions (11P81) Partitions; congruences and congruential restrictions (11P83)

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 $x_1,x_2,\mathrm{...},x_l,y$ satisfying the congruence $$. 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,\mathrm{...},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.

Review text

Summary: 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 \(x_1,x_2,\ldots,x_l,y\) satisfying the congruence \(x_1+\ldots+x_l\equiv y\bmod{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,\ldots,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.

Recommendations

• New lower bounds for weak Schur partitions
• scientific article; zbMATH DE number 637325
• On a zero-sum generalization of a variation of Schur's equation
• Lower bounds on the weak Schur numbers up to 9 colors
• Publication:3204538

Cites work

• A lower bound for Schur numbers and multicolor Ramsey numbers
• A problem of Schur and its generalizations
• An extension of Schur's theorem on sum-free partitions
• scientific article; zbMATH DE number 3784892 (Why is no real title available?)
• scientific article; zbMATH DE number 192839 (Why is no real title available?)
• scientific article; zbMATH DE number 2033289 (Why is no real title available?)
• Partitions into sum-free sets
• Studien zur Kombinatorik
• Sum-Free Sets of Integers
• Symmetric sum-free partitions and lower bounds for Schur numbers
• Unsolved problems in number theory
• Weak Schur numbers and the search for G. W. Walker's lost partitions

Cited in

(7)

• Cunningham numbers in modular arithmetic
• Strict Schur numbers
• On the modular sumset partition problem
• On Schreier-type Sets, Partitions, and Compositions
• Modular generalizations of Schur numbers
• Modular generalisations of weak Schur numbers
• A dynamic version of Schur's problem for rotations on the unit interval

This page was built for publication: Modular Schur numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396788)