Papers
Topics
Authors
Recent
Search
2000 character limit reached

Monochromatic non-commuting products

Published 6 May 2024 in math.CO, math.DS, and math.NT | (2405.03772v1)

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 callquasirandom colorings,' a condition that is automatically satisfied by colorings of quasirandom groups, and a reduction to this case.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.