In
Ramsey theory
Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of mathematics that focuses on the appearance of order in a substructure given a structure of a known size. Problems in Ramsey theory typically ask ...
, a
set ''S'' of
natural number
In mathematics, the natural numbers are those numbers used for counting (as in "there are ''six'' coins on the table") and ordering (as in "this is the ''third'' largest city in the country").
Numbers used for counting are called '' cardinal ...
s is considered to be a large set if and only if
Van der Waerden's theorem
Van der Waerden's theorem is a theorem in the branch of mathematics called Ramsey theory. Van der Waerden's theorem states that for any given positive integers ''r'' and ''k'', there is some number ''N'' such that if the integers are colored, ea ...
can be generalized to assert the existence of
arithmetic progressions
An arithmetic progression or arithmetic sequence () is a sequence of numbers such that the difference between the consecutive terms is constant. For instance, the sequence 5, 7, 9, 11, 13, 15, . . . is an arithmetic progression with a common differ ...
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
*The natural numbers are large. This is precisely the assertion of
Van der Waerden's theorem
Van der Waerden's theorem is a theorem in the branch of mathematics called Ramsey theory. Van der Waerden's theorem states that for any given positive integers ''r'' and ''k'', there is some number ''N'' such that if the integers are colored, ea ...
.
*The even numbers are large.
Properties
Necessary conditions for largeness include:
*If ''S'' is large, for any natural number ''n'', ''S'' must contain at least one multiple (equivalently, infinitely many multiples) of ''n''.
*If
is large, it is not the case that ''s''
k≥3''s''
k-1 for ''k''≥ 2.
Two sufficient conditions are:
*If ''S'' contains n-cubes for
arbitrarily large In mathematics, the phrases arbitrarily large, arbitrarily small and arbitrarily long are used in statements to make clear of the fact that an object is large, small and long with little limitation or restraint, respectively. The use of "arbitraril ...
n, then ''S'' is large.
*If
where
is a polynomial with
and positive leading coefficient, then
is large.
The first sufficient condition implies that if ''S'' is a
thick set In mathematics, a thick set is a set of integers that contains arbitrarily long intervals. That is, given a thick set T, for every p \in \mathbb, there is some n \in \mathbb such that \ \subset T.
Examples
Trivially \mathbb is a thick set. Othe ...
, then ''S'' is large.
Other facts about large sets include:
*If ''S'' is large and ''F'' is finite, then ''S
–
The dash is a punctuation mark consisting of a long horizontal line. It is similar in appearance to the hyphen but is longer and sometimes higher from the baseline. The most common versions are the endash , generally longer than the hyphen b ...
F'' is large.
*
is large.
*If S is large,
is also large.
If
is large, then for any
,
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
Van der Waerden's theorem is a theorem in the branch of mathematics called Ramsey theory. Van der Waerden's theorem states that for any given positive integers ''r'' and ''k'', there is some number ''N'' such that if the integers are colored, ea ...
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:
*''k''-largeness implies (''k''-1)-largeness for k>1
*''k''-largeness for all ''k'' implies largeness.
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
*
Partition of a set
In mathematics, a partition of a set is a grouping of its elements into non-empty subsets, in such a way that every element is included in exactly one subset.
Every equivalence relation on a set defines a partition of this set, and every pa ...
Further reading
*{{cite journal , last1=Brown , first1=Tom , last2=Graham , first2=Ronald , authorlink2=Ronald Graham , last3=Landman , first3=Bruce , title=On the Set of Common Differences in van der Waerden's Theorem on Arithmetic Progressions , journal=
Canadian Mathematical Bulletin
The ''Canadian Mathematical Bulletin'' (french: Bulletin Canadien de Mathématiques) is a mathematics journal, established in 1958 and published quarterly by the Canadian Mathematical Society. The current editors-in-chief of the journal are Anto ...
, volume=42 , issue=1 , year=1999 , pages=25–36 , doi=10.4153/cmb-1999-003-9, doi-access=free
External links
Mathworld: van der Waerden's Theorem
Basic concepts in set theory
Ramsey theory
Theorems in discrete mathematics