We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form ,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.
No takes yet. Share an insight, caveat, or question.
Matt Bowen (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: