Finding Product and Sum Patterns in non-commutative settings (2404.19650v1)
Abstract: Hindman conjectured that any finite partition of $\mathbb{N}$ has a monochromatic ${x,y,x+y,xy}$. Recently, Bowen proved the result for all 2-partition. In this paper, we extend Bowen's result to any semiring $(S,+,\cdot)$ such that $Ss$ is piecewise syndetic for all $s\in S$. As a method, we gave a combinatorial proof for a piecewise syndetic version of Bergerson and Glasscock's IP$_r*$ Szemer\'edi Theorem, and discussed the case when the operation is not commutative.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.