2000 character limit reached
Monochromatic non-commuting products (2405.03772v1)
Published 6 May 2024 in math.CO, math.DS, and math.NT
Abstract: We show that a finite coloring of an amenable group contains many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and McCutcheon's non-commutative Schur theorem. Our main new tool is the introduction of what we call
quasirandom colorings,' a condition that is automatically satisfied by colorings of quasirandom groups, and a reduction to this case.
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.