On the number of monochromatic solutions of integer linear systems on Abelian groups
Abstract
Let G be a finite abelian group with exponent n, and let r be a positive integer. Let A be a k× m matrix with integer entries. We show that if A satisfies some natural conditions and |G| is large enough then, for each r--coloring of G \0\, there is δ depending only on r,n and m such that the homogeneous linear system Ax=0 has at least δ |G|m-k monochromatic solutions. Density versions of this counting result are also addressed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.