Saturated calomel electrode: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>RibotBOT
 
en>Monkbot
Line 1: Line 1:
Hi there, I am Alyson Pomerleau and I believe it seems quite good when you say it. Ohio is where my home is but my husband wants us to move. He is an order clerk and it's something he really enjoy. My husband doesn't like it the way I do but what I truly like doing is caving but I don't have the time lately.<br><br>Also visit my site: [http://www.octionx.sinfauganda.co.ug/node/22469 psychic readings]
:''For other uses of the term, see [[Large set (disambiguation)]].''
In [[Ramsey theory]], a [[Set (mathematics)|set]] ''S'' of [[natural number]]s 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 <math>S=\{s_1,s_2,s_3,\dots\}</math> is large, it is not the case that ''s''<sub>k</sub>≥3''s''<sub>k-1</sub> for ''k''≥ 2.
 
Two sufficient conditions are:
*If ''S'' contains n-cubes for [[arbitrarily large]] n, then ''S'' is large.
*If <math>S =p(\mathbb{N}) \cap \mathbb{N}</math> where <math>p</math> is a polynomial with <math>p(0)=0</math> and positive leading coefficient, then <math>S</math> 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&nbsp;[[Complement (set theory)|–]]&nbsp;F'' is large.
*<math>k\cdot \mathbb{N}=\{k,2k,3k,\dots\}</math> is large. Similarly, if S is large, <math>k\cdot S</math> is also large.
If <math>S</math> is large, then for any <math>m</math>, <math>S \cap \{ x : x \equiv 0\pmod{m} \}</math> 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&gt;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.
 
==See 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]
 
[[Category:Ramsey theory]]

Revision as of 20:50, 29 January 2014

For other uses of the term, see Large set (disambiguation).

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:

  • If S is large, for any natural number n, S must contain infinitely many multiples of n.
  • If S={s1,s2,s3,} is large, it is not the case that sk≥3sk-1 for k≥ 2.

Two sufficient conditions are:

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, then for any m, S{x:x0(modm)} 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.

See also

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. pdf

External links