Monochromatic Translated Product and Answering Sahasrabudhe's Conjecture
Sayan Goswami

TL;DR
This paper proves the existence of monochromatic configurations in finite colorings of natural numbers, disproves Sahasrabudhe's conjecture, and advances the understanding of Hindman's conjecture in Ramsey theory.
Contribution
It introduces a new monochromatic configuration involving sums and ratios, disproves a prior conjecture, and establishes a quotient version of Hindman's conjecture.
Findings
Existence of monochromatic sets of the form {a, b, ab, a(b+1)} in finite colorings.
Disproof of Sahasrabudhe's conjecture.
Establishment of a quotient version of Hindman's conjecture.
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 .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories · Mathematics and Applications · graph theory and CDMA systems
