A note on Hindman-type theorems for uncountable cardinals (Q1732799): Difference between revisions

Hindman's theorem can be stated as follows: If the finite subsets of \(\omega\) are colored in finite many colors, then there exists an infinite family of pairwise disjoint finite subsets of \(\omega\) such that all elements of all finite nonempty unions of elements of the family have the same color. Erdős asked whether analogs of Hindman's theorem hold for uncountable cardinals. A number of results are known which show that natural analogs of Hindman's theorem fail for uncountable cardinals. So weaker forms of the Hindman property are of interest. In these weaker forms only sums of special length are allowed. Komjath showed that there are arbitrary large abelian groups satisfying some Hindman property. In this note, the author shows that an argument he used in an earlier paper in the countable setting can be lifted for uncountable cardinals. Instead of the Ramsey theorem he uses here a combination of the Erdős-Rado theorem and the Van der Waerden theorem.