Large set (Ramsey theory)

Large set (Ramsey theory)

:"For other uses of the term, see Large set."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

*The natural numbers are large. This is precisely the assertion of Van der Waerden's theorem.
*The even numbers are large.

Properties

Necessary conditions for largeness include:
*If "S" is large, for any natural number "n", "S" must contain infinitely many multiples of "n".
*If S={s_1,s_2,s_3,dots} is large, it is not the case that "s"k≥3"s"k-1 for "k"≥ 2.

Two sufficient conditions are:
*If "S" contains arbitrarily long n-cubes, then "S" is large.
*If S =p(mathbb{N}) cap mathbb{N} 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:
*If "S" is large and "F" is finite, then "S F" is large.
*kcdot mathbb{N}={k,2k,3k,dots} is large. Similarly, if S is large, kcdot S is also large.If S is large, then for any m, S cap { x : x equiv 0pmod{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:
*"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 set exists.

ee also

*Partition of a set

References

*Brown, Tom, Ronald Graham, & Bruce Landman. "On the Set of Common Differences in van der Waerden's Theorem on Arithmetic Progressions." Canadian Math Bulletin, Vol 42 (1), 1999. p 25-36. [http://www.journals.cms.math.ca/cgi-bin/vault/public/view/brown7227/body/PDF/brown7227.pdf?file=brown7227 pdf]

External links

* [http://mathworld.wolfram.com/vanderWaerdensTheorem.html Mathworld: van der Waerden's Theorem]


Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Large set — In mathematics, the term large set is sometimes used to refer to any set that is large in some sense. It has specialized meanings in three branches of mathematics: *Large set (category theory) *Large set (combinatorics) *Large set (Ramsey… …   Wikipedia

  • Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices …   Wikipedia

  • List of exceptional set concepts — This is a list of exceptional set concepts. In mathematics, and in particular in mathematical analysis, it is very useful to be able to characterise subsets of a given set X as small , in some definite sense, or large if their complement in X is… …   Wikipedia

  • Small set — In mathematics, the term small set may refer to: *Small set (category theory) *Small set (combinatorics)ee also*Ideal (set theory) *Natural density *Large set (Ramsey theory) …   Wikipedia

  • Ramsey's theorem — This article goes into technical details quite quickly. For a slightly gentler introduction see Ramsey theory. In combinatorics, Ramsey s theorem states that in any colouring of the edges of a sufficiently large complete graph (that is, a simple… …   Wikipedia

  • Set theory — This article is about the branch of mathematics. For musical set theory, see Set theory (music). A Venn diagram illustrating the intersection of two sets. Set theory is the branch of mathematics that studies sets, which are collections of objects …   Wikipedia

  • Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue …   Wikipedia

  • Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and …   Wikipedia

  • IP set — In mathematics, an IP set is a set of natural numbers which contains all finite sums of some infinite set.The finite sums of a set D of natural numbers are all those numbers that can be obtained by adding up the elements of some finite nonempty… …   Wikipedia

  • Piecewise syndetic set — In mathematics, piecewise syndeticity is a notion of largeness of subsets of the natural numbers. Let mathcal{P} f(mathbb{N}) denote the set of finite subsets of mathbb{N}. Then a set S sub mathbb{N} is called piecewise syndetic if there exists G …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”