Avoiding Monochromatic Sequences With Special Gaps

Details Avoiding Monochromatic Sequences With Special Gaps Avoiding Monochromatic Sequences With Special Gaps

2003-02-04

arxiv.org/abs/math/0302041v1

Mathematics

Combinatorics

16 pages

Scientific paper

For $S$ a set of positive integers, and $k$ and $r$ fixed positive integers, denote by $f(S,k;r)$ the least positive integer $n$ (if it exists) such that within every $r$-coloring of $\{1,2,...,n\}$ there must be a monochromatic sequence $\{x_{1},x_{2},...,x_{k}\}$ with $x_{i}-x_{i-1} \in S$ for $2 \leq i \leq k$. We consider the existence of $f(S,k;r)$ for various choices of $S$, as well as upper and lower bounds on this function. In particular, we show that this function exists for all $k$ if $S$ is an odd translate of the set of primes and $r=2$.

Affiliated with

Also associated with

No associations

Rating

Avoiding Monochromatic Sequences With Special Gaps does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Avoiding Monochromatic Sequences With Special Gaps, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Avoiding Monochromatic Sequences With Special Gaps will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-269512