On generalized van der waerden triples

Bruce M. Landman, Aaron Robertson

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term arithmetic progression {x,x + d, x + 2d,...,x + (k - 1)d}. We investigate the following generalization of w(3,r). For fixed positive integers a and b with a ≤ b, define N(a, b; r) to be the least positive integer, if it exists, such that any r-coloring of {1,2,...,N(a,b;r)} must contain a monochromatic set of the form {x,ax + d,bx + 2d}. We show that N(a,b;2) exists if and only if b≠2a, and provide upper and lower bounds for it. We then show that for a large class of pairs (a,b), N(a,b;r) does not exist for r sufficiently large. We also give a result on sets of the form {x,ax + d,ax + 2d,...,ax + (k - 1)d}.

Original languageEnglish (US)
Pages (from-to)279-290
Number of pages12
JournalDiscrete Mathematics
Volume256
Issue number1-2
DOIs
StatePublished - Sep 28 2002
Externally publishedYes

Fingerprint

Coloring
Integer
Arithmetic sequence
Colouring
Upper and Lower Bounds
If and only if
Term
Theorem
Form

Keywords

  • Arithmetic progressions
  • Van der Waerden

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

On generalized van der waerden triples. / Landman, Bruce M.; Robertson, Aaron.

In: Discrete Mathematics, Vol. 256, No. 1-2, 28.09.2002, p. 279-290.

Research output: Contribution to journalArticle

Landman, Bruce M. ; Robertson, Aaron. / On generalized van der waerden triples. In: Discrete Mathematics. 2002 ; Vol. 256, No. 1-2. pp. 279-290.
@article{c0e8064cdead47669b36a075e6bd1191,
title = "On generalized van der waerden triples",
abstract = "Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term arithmetic progression {x,x + d, x + 2d,...,x + (k - 1)d}. We investigate the following generalization of w(3,r). For fixed positive integers a and b with a ≤ b, define N(a, b; r) to be the least positive integer, if it exists, such that any r-coloring of {1,2,...,N(a,b;r)} must contain a monochromatic set of the form {x,ax + d,bx + 2d}. We show that N(a,b;2) exists if and only if b≠2a, and provide upper and lower bounds for it. We then show that for a large class of pairs (a,b), N(a,b;r) does not exist for r sufficiently large. We also give a result on sets of the form {x,ax + d,ax + 2d,...,ax + (k - 1)d}.",
keywords = "Arithmetic progressions, Van der Waerden",
author = "Landman, {Bruce M.} and Aaron Robertson",
year = "2002",
month = "9",
day = "28",
doi = "10.1016/S0012-365X(01)00436-8",
language = "English (US)",
volume = "256",
pages = "279--290",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-2",

}

TY - JOUR

T1 - On generalized van der waerden triples

AU - Landman, Bruce M.

AU - Robertson, Aaron

PY - 2002/9/28

Y1 - 2002/9/28

N2 - Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term arithmetic progression {x,x + d, x + 2d,...,x + (k - 1)d}. We investigate the following generalization of w(3,r). For fixed positive integers a and b with a ≤ b, define N(a, b; r) to be the least positive integer, if it exists, such that any r-coloring of {1,2,...,N(a,b;r)} must contain a monochromatic set of the form {x,ax + d,bx + 2d}. We show that N(a,b;2) exists if and only if b≠2a, and provide upper and lower bounds for it. We then show that for a large class of pairs (a,b), N(a,b;r) does not exist for r sufficiently large. We also give a result on sets of the form {x,ax + d,ax + 2d,...,ax + (k - 1)d}.

AB - Van der Waerden's classical theorem on arithmetic progressions states that for any positive integers k and r, there exists a least positive integer, w(k,r), such that any r-coloring of {1,2,...,w(k,r)} must contain a monochromatic k-term arithmetic progression {x,x + d, x + 2d,...,x + (k - 1)d}. We investigate the following generalization of w(3,r). For fixed positive integers a and b with a ≤ b, define N(a, b; r) to be the least positive integer, if it exists, such that any r-coloring of {1,2,...,N(a,b;r)} must contain a monochromatic set of the form {x,ax + d,bx + 2d}. We show that N(a,b;2) exists if and only if b≠2a, and provide upper and lower bounds for it. We then show that for a large class of pairs (a,b), N(a,b;r) does not exist for r sufficiently large. We also give a result on sets of the form {x,ax + d,ax + 2d,...,ax + (k - 1)d}.

KW - Arithmetic progressions

KW - Van der Waerden

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

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

U2 - 10.1016/S0012-365X(01)00436-8

DO - 10.1016/S0012-365X(01)00436-8

M3 - Article

VL - 256

SP - 279

EP - 290

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-2

ER -