On The Partition Regularity of ax+by = cwmzn
Abstract
Csikv\'ari, Gyarmati, and S\'ark\"ozy showed that the equation x+y = z2 is not partition regular (PR) over N and asked if the equation x+y = wz is PR over N. Bergelson and Hindman independently answered this question in the positive. We generalize this result by giving a partial classification of the a,b,c ∈ Z\0\ and m,n ∈ N for which the equation ax+by = cwmzn is PR over Z\0\. We show that if m,n 2, then ax+by = cwmzn is PR over Z\0\ if and only if a+b = 0. Next, we show that if n is odd, then the equation ax+by = cwzn is PR over Z\0\ if and only if one of ac, bc, or a+bc is an nth power in Q. We come close to a similar characterization of the partition regularity of ax+by = cwzn over Z\0\ for even n, and we examine some equations whose partition regularity remain unknown, such as 16x+17y = wz8. In order to show that the equation ax+by = cwzn is not PR over Z\0\ for certain values of a,b,c, and n, we prove a partial generalization of the criteria of Grunwald and Wang for when α ∈ Z is an nth power modulo every prime p. In particular, we show that for any odd n and any α,β,γ ∈ Q that are not nth powers, there exist infinitely many primes p ∈ N for which none of α,β, and γ are nth powers modulo p. Similarly, we show that for any even n and any α,β,γ ∈ Q that are not n2th powers, with one not an n4th power if 4|n, there exist infinitely many primes p ∈ N for which α,β, and γ are not nth powers modulo p. Part of the abstract was removed here.
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.