Monochromatic Translated Product and Answering Sahasrabudhe's Conjecture
arXiv:2412.17868
Abstract
This article resolves two related problems in Ramsey theory on the integers. We show that for any finite coloring of the set of natural numbers, there exist numbers and for which the configuration is monochromatic. By redefining the variables and our configurations transforms into This finding has two main consequences: first, it disproves a conjecture proposed by J. Sahasrabudhe; second, it establishes a quotient version of the long-standing Hindman's conjecture, which asks for a monochromatic set of the form .
Final version