Answers are grounded in this paper and cite their sources.
Theoretical proof demonstrates monochromatic product patterns near zero in dense subsemigroups, indicating partition regularity near origin boundaries.
Goswami [‘Monochromatic translated product and answering Sahasrabudhe’s conjecture’, Adv. Combin. (2026), https://doi.org/10.19086/aic.2026.2] proved that whenever the set N N double struck upper N of natural numbers is finitely coloured, the set { a , b , a b , b ( a + 1 ) } , b, ab, b(a+1)\ StartSet a comma b comma a b comma b left parenthesis a plus 1 right parenthesis EndSet is monochromatic. This also established a variant of the long-standing Hindman’s conjecture, which asks for a monochromatic set of the form { a , b , a b , a + b } , b, ab, a+b\ StartSet a comma b comma a b comma a plus b EndSet , and disproved a conjecture proposed by Sahasrabudhe that { a , b , a ( b + 1 ) } , b, a(b + 1)\ StartSet a comma b comma a left parenthesis b plus 1 right parenthesis EndSet is not partition regular. In this paper, we prove that { a , b , a b , b ( a + 1 ) } , b, ab, b(a+1)\ StartSet a comma b comma a b comma b left parenthesis a plus 1 right parenthesis EndSet is monochromatic near zero, which means that for every finite colouring of a dense subsemigroup of ( ( 0 , ∞ ) , + ) ((0, ∞ ), +)
No takes yet. Share an insight, caveat, or question.
Shaikh et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: