The Schur degree of additive sets
From MaRDI portal
Publication:2659244
DOI10.1016/J.DISC.2021.112332zbMATH Open1472.11079arXiv2006.01502OpenAlexW3034082948MaRDI QIDQ2659244FDOQ2659244
M. P. Revuelta, Shalom Eliahou
Publication date: 25 March 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Abstract: Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The classical inequality S(n) R n (3) -- 2, between the Schur number S(n) and the Ramsey number R n (3) = R(3,. .. , 3), is shown to remain valid in a wider context, involving the Schur degree of certain subsets of G. Recursive upper bounds are known for R n (3) but not for S(n) so far. We formulate a conjecture which, if true, would fill this gap. Indeed, our study of the Schur degree leads us to conjecture S(n) n(S(n -- 1) + 1) for all n 2. If true, it would yield substantially better upper bounds on the Schur numbers, e.g. S(6) 966 conjecturally, whereas all is known so far is 536 S(6) 1836.
Full work available at URL: https://arxiv.org/abs/2006.01502
Recommendations
Cites Work
- The Mathematical Coloring Book
- Combinatorial Relations and Chromatic Graphs
- Symmetric sum-free partitions and lower bounds for Schur numbers
- An adaptive upper bound on the Ramsey numbers $R(3,\dots,3)$
- Title not available (Why is that?)
- On the Ramsey numbers N(3,3,\dots ,3;2)
- Equation-regular sets and the Fox-Kleitman conjecture
- On Some Open Questions for Ramsey and Folkman Numbers
Cited In (3)
Uses Software
This page was built for publication: The Schur degree of additive sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2659244)