Monochromatic Sums and Quotients Near Zero
Combinatorics
2026-04-23 v1
Abstract
Recently S. Goswami proved that whenever the set of natural numbers is finitely colored, the set is monochromatic which also established a variant of the long-standing Hindman's conjecture, which asks for a monochromatic set of the form . Actually he disproved a conjecture proposed by J. Sahasrabudhe that is not partition regular. In this paper we prove that is monochromatic near zero which means for every finite coloring of a dense subsemigroups of , the set is monochromatic near zero or in other words, we will get in a dense subsemigroups of as small as we want such that the set is monochromatic for every finite coloring of that dense subsemigroups of , also we show that the pattern is partition regular near zero.
Keywords
Cite
@article{arxiv.2604.20106,
title = {Monochromatic Sums and Quotients Near Zero},
author = {Md Moid Shaikh and Sourav Kanti Patra and Mukesh Kumar},
journal= {arXiv preprint arXiv:2604.20106},
year = {2026}
}
Comments
10 pages