A note on long rainbow arithmetic progressions

Publication date 19 November 2018

Abstract: Jungi'{c} et al (2003) defined

T_{k}

as the minimal number

t i n m a t h b b N

such that there is a rainbow arithmetic progression of length

k

in every equinumerous

t

-coloring of

[t n]

for every

n i n m a t h b b N

. They proved that for every

k g e q 3

,

l f l o o r f r a c k^{2} 4 f l o o r < T_{k} l e q f r a c k (k - 1)^{2} 2

and conjectured that

T_{k} = T h e t a (k^{2})

. We prove for all

e p s i l o n > 0

that

T_{k} = O (k^{5 / 2 + e p s i l o n})

using the KH{o}v'{a}ri-S'{o}s-Tur'{a}n theorem and Wigert's bound on the divisor function.

This page was built for publication: A note on long rainbow arithmetic progressions