Finding Product and Sum Patterns in non-commutative settings

Abstract

Hindman conjectured that any finite partition of 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,+,·) such that Ss is piecewise syndetic for all s∈ S. As a method, we gave a combinatorial proof for a piecewise syndetic version of Bergerson and Glasscock's IPr* Szemer\'edi Theorem, and discussed the case when the operation is not commutative.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…