Modular Schur numbers
From MaRDI portal
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 satisfying the congruence . It is proved that, for any positive integers k and l, there exists a largest integer for which the set of the first positive integers admits a partition into k (weakly) l-sum-free sets modulo m. This number is called the generalized (weak) Schur number modulo , 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
Cites work
- 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?)
- 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
- 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
(4)
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)