Avoiding monochromatic sequences with special gaps

Bruce M. Landman, Aaron Robertson

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

For S ⊆ ℤ+ 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, x2,....xk} with xi - x i-1 ∈ S for 2 ≤ i ≤ 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 5 is an odd translate of the set of primes and r = 2.

Original languageEnglish (US)
Pages (from-to)794-801
Number of pages8
JournalSIAM Journal on Discrete Mathematics
Volume21
Issue number3
DOIs
StatePublished - Dec 1 2007

Fingerprint

Integer
Colouring
Upper and Lower Bounds
Odd
Denote

Keywords

  • Arithmetic progressions
  • Primes in progression
  • Ramsey theory

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

Avoiding monochromatic sequences with special gaps. / Landman, Bruce M.; Robertson, Aaron.

In: SIAM Journal on Discrete Mathematics, Vol. 21, No. 3, 01.12.2007, p. 794-801.

Research output: Contribution to journalArticle

@article{5ec06bf46bf441b8b1cfd2e6c565ad96,
title = "Avoiding monochromatic sequences with special gaps",
abstract = "For S ⊆ ℤ+ 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, x2,....xk} with xi - x i-1 ∈ S for 2 ≤ i ≤ 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 5 is an odd translate of the set of primes and r = 2.",
keywords = "Arithmetic progressions, Primes in progression, Ramsey theory",
author = "Landman, {Bruce M.} and Aaron Robertson",
year = "2007",
month = "12",
day = "1",
doi = "10.1137/S0895480103422196",
language = "English (US)",
volume = "21",
pages = "794--801",
journal = "SIAM Journal on Discrete Mathematics",
issn = "0895-4801",
publisher = "Society for Industrial and Applied Mathematics Publications",
number = "3",

}

TY - JOUR

T1 - Avoiding monochromatic sequences with special gaps

AU - Landman, Bruce M.

AU - Robertson, Aaron

PY - 2007/12/1

Y1 - 2007/12/1

N2 - For S ⊆ ℤ+ 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, x2,....xk} with xi - x i-1 ∈ S for 2 ≤ i ≤ 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 5 is an odd translate of the set of primes and r = 2.

AB - For S ⊆ ℤ+ 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, x2,....xk} with xi - x i-1 ∈ S for 2 ≤ i ≤ 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 5 is an odd translate of the set of primes and r = 2.

KW - Arithmetic progressions

KW - Primes in progression

KW - Ramsey theory

UR - http://www.scopus.com/inward/record.url?scp=49449102333&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49449102333&partnerID=8YFLogxK

U2 - 10.1137/S0895480103422196

DO - 10.1137/S0895480103422196

M3 - Article

AN - SCOPUS:49449102333

VL - 21

SP - 794

EP - 801

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

SN - 0895-4801

IS - 3

ER -