Family 164CombinatoricsNo LeanNot yet digested
Hindman’s finite sums and products conjecture
Proves Hindman's finite sums and products conjecture: every finite coloring of the positive integers contains sets of any prescribed finite size whose nonempty subset sums and nonempty subset products all have one common color.
Manuscripts in this family · 1
Monochromatic finite sums and products in the positive integers
Sep 23, 2026·paper.pdf
We prove Hindman's finite sums and products conjecture: for every finite coloring of the positive integers and every positive integer k, there is a k-element set whose nonempty subset sums and nonempty subset products all have the same color.