Schur's theorem in integer lattices

MaRDI QIDQ5095308zbMATH OpenFDO

Authors V. Balaji, Andrew Lott, Alex Rice

Publication date 8 August 2022

Full work available at URL https://arxiv.org/abs/2112.03127, http://math.colgate.edu/~integers/w62/w62.pdf

Mathematics Subject Classification ID

Ramsey theory (05D10) Other combinatorial number theory (11B75)

Abstract: A standard proof of Schur's Theorem yields that any $r$-coloring of $1,2,dots,R_r-1$ yields a monochromatic solution to $x+y=z$, where $R_r$ is the classical $r$-color Ramsey number, the minimum $N$ such that any $r$-coloring of a complete graph on $N$ vertices yields a monochromatic triangle. We explore generalizations and modifications of this result in higher dimensional integer lattices, showing in particular that if $kgeqd+1$, then any $r$-coloring of ${1,2,dots,R_r(k{)}^d-1}^d$ yields a monochromatic solution to $x_1+cdots+x_{k-1}=x_k$ with $x_1,dots,x_d$ linearly independent, where $R_r(k)$ is the analogous Ramsey number in which triangles are replaced by complete graphs on $k$ vertices. We also obtain computational results and examples in the case $d=2$, $k=3$, and $rin2,3,4$.

Recommendations

• On a variation of Schur numbers
• On Generalized Schur Numbers
• scientific article; zbMATH DE number 637325
• scientific article; zbMATH DE number 6266498
• scientific article; zbMATH DE number 5844095

Cites work

• 3-color Schur numbers

Cited in

(7)

• On sets of integers with the Schur property
• A Brunn-Minkowski inequality for the integer lattice
• Strict Schur numbers
• A Kleene-Schützenberger theorem for trace series over bounded lattices
• On the minimum number of monochromatic 2-dimensional Schur triples
• A multidimensional Rado theorem
• Ramsey theory on the integer grid: the ``L problem

This page was built for publication: Schur's theorem in integer lattices

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