{"ref":"master","ref_type":"branch","master_branch":"master","description":"See http://discreteanalysisjournal.com/article/613-monochromatic-sums-and-products for a description of the problem. For dimension two the problem is solved, namely the answer is [1,251] proved in the 70-80's with the use of a computer program. This programs takes a few hours to get to the same conclusion in python. The hope is that this version in C is much faster, and we can establish results for higher dimensions. If anything, at least minimum bounds.","pusher_type":"user"}
{"actor":{"display_login":"ReverseControl"}}