Finding Product and Sum Patterns in non-commutative settings
arXiv:2404.19650
Abstract
Hindman conjectured that any finite partition of has a monochromatic . Recently, Bowen proved the result for all 2-partition. In this paper, we extend Bowen's result to any semiring such that is piecewise syndetic for all . As a method, we gave a combinatorial proof for a piecewise syndetic version of Bergerson and Glasscock's IP Szemerédi Theorem, and discussed the case when the operation is not commutative.
18 pages