Rainbow Free Colorings and Rainbow Numbers for x-y=z^2

Abstract: An exact r-coloring of a set

S

is a surjective function

c : S i g h t a r r o w 1, 2, l d o t s, r

. A rainbow solution to an equation over

S

is a solution such that all components are a different color. We prove that every 3-coloring of

m a t h b b N

with an upper density greater than

(4^{s} - 1) / (3 c d o t 4^{s})

contains a rainbow solution to

x - y = z^{k}

. The rainbow number for an equation in the set

S

is the smallest integer

r

such that every exact

r

-coloring has a rainbow solution. We compute the rainbow numbers of

m a t h b b Z_{p}

for the equation

x - y = z^{k}

, where

p

is prime and

k g e q 2

.

This page was built for publication: Rainbow Free Colorings and Rainbow Numbers for $x-y=z^2$