New bounds on diffsequences

Abstract: For a set of positive integers

D

, a

k

-term

D

-diffsequence is a sequence of positive integers

a_{1} < a_{2} < c d o t s < a_{k}

such that

a_{i} - a_{i - 1} i n D

for

i = 2, 3, c d o t s, k

. For

k i n m a t h b b Z^{+}

and

D s u b s e t m a t h b b Z^{+}

, we define

D e l t a (D, k)

, if it exists, to be the smallest integer

n

such that every

2

-coloring of

1, 2, c d o t s, n

contains a monochromatic

D

-diffsequence of length

k

. We improve the lower bound on

D e l t a (D, k)

where

D = 2^{i} m i d i i n m a t h b b Z_{g e q 0}

, proving a conjecture of Chokshi, Clifton, Landman, and Sawin. We also determine all sets of the form

D = d_{1}, d_{2}, d o t s

with

d_{i} m i d d_{i + 1}

for which

D e l t a (D, k)

exists.

Recommendations

Cites work

Cited in

(2)

This page was built for publication: New bounds on diffsequences