The adjacent Hindman's theorem for uncountable groups

TL;DR

This paper introduces the Adjacent Hindman's Theorem for uncountable groups, establishing a new variant that guarantees monochromatic finite products of adjacent elements in large groups, extending Hindman's Theorem beyond countable cases.

Contribution

It proves a novel uncountable variant of Hindman's Theorem applicable to both Abelian and non-Abelian groups, with optimal bounds and monochromatic products of unbounded length.

Findings

Established bounds on the size of groups for the theorem to hold

First Hindman-type result for uncountable non-Abelian groups

Guarantees monochromatic finite products of unbounded length

Abstract

Recent results of Hindman, Leader and Strauss and of the second author and Rinot showed that some natural analogs of Hindman's Theorem fail for all uncountable cardinals. Results in the positive direction were obtained by Komj\'ath, the first author, and the second author and Lee, who showed that there are arbitrarily large Abelian groups satisfying some Hindman-type property. Inspired by an analogous result studied by the first author in the countable setting, we prove a new variant of Hindman's Theorem for uncountable cardinals, called the Adjacent Hindman's Theorem: For every $\kappa$ there is a $\lambda$ such that, whenever a group $G$ of cardinality $\lambda$ is coloured with $\kappa$ colours, there exists a $\lambda$-sized injective sequence of elements of $G$ with all finite products of adjacent terms of the sequence of the same colour. We obtain bounds on $\lambda$ as a function of $\kappa$, and prove that such bounds are optimal. This is the first example of a Hindman-type result for uncountable cardinals that we can prove also in the non-Abelian setting and, furthermore, it is the first such example where monochromatic products (or sums) of unbounded length are guaranteed.