Large set (Ramsey theory) explained

In Ramsey theory, a set S of natural numbers is considered to be a large set if and only if Van der Waerden's theorem can be generalized to assert the existence of arithmetic progressions with common difference in S. That is, S is large if and only if every finite partition of the natural numbers has a cell containing arbitrarily long arithmetic progressions having common differences in S.

Examples

Properties

Necessary conditions for largeness include:

S=\{s1,s2,s3,...\}

is large, it is not the case that sk≥3sk-1 for k≥ 2.

Two sufficient conditions are:

S=p(N)\capN

where

p

is a polynomial with

p(0)=0

and positive leading coefficient, then

S

is large.

The first sufficient condition implies that if S is a thick set, then S is large.

Other facts about large sets include:

kN=\{k,2k,3k,...\}

is large.

kS

is also large.If

S

is large, then for any

m

,

S\cap\{x:x\equiv0\pmod{m}\}

is large.

2-large and k-large sets

A set is k-large, for a natural number k > 0, when it meets the conditions for largeness when the restatement of van der Waerden's theorem is concerned only with k-colorings. Every set is either large or k-large for some maximal k. This follows from two important, albeit trivially true, facts:

It is unknown whether there are 2-large sets that are not also large sets. Brown, Graham, and Landman (1999) conjecture that no such sets exists.

See also

Further reading

External links