Piecewise syndetic set

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 in mathcal{P}_f(mathbb{N}) such that for every F in mathcal{P}_f(mathbb{N}) there exists an x in mathbb{N} such that

:x+F subset igcup_{n in G} (S-n)

where S-n = {m in mathbb{N}: m+n in S }. Informally, "S" is piecewise syndetic if "S" contains arbitrarily long intervals with gaps bounded by some fixed bound "b".

Properties

* A set is piecewise syndetic if and only if it is the intersection of a syndetic set and a thick set.

* If "S" is piecewise syndetic then "S" contains arbitrarily long arithmetic progressions.

* A set "S" is piecewise syndetic if and only if there exists some ultrafilter "U" which contains "S" and "U" is in the smallest two-sided ideal of eta mathbb{N}, the Stone–Čech compactification of the natural numbers.

* Partition regularity: if S is piecewise syndetic and S = C_1 cup C_2 cup ... cup C_n, then for some i leq n, C_i contains a piecewise syndetic set. (Brown, 1968)

* If "A" and "B" are subsets of mathbb{N}, and "A" and "B" have positive upper Banach density, then A+B={a+b:a in A, b in B} is piecewise syndetic [R. Jin, [http://math.cofc.edu/faculty/jin/research/banach.pdf Nonstandard Methods For Upper Banach Density Problems] , "Journal of Number Theory" 91, (2001), 20-38.]

Other Notions of Largeness

There are many alternative definitions of largeness that also usefully distinguish subsets of natural numbers:

* cofinite
* positive upper density
* syndetic
* thick
* member of a nonprincipal ultrafilter
* IP set

See also

*Ergodic Ramsey theory

References

* J. McLeod, " [http://www.mtholyoke.edu/~jmcleod/somenotionsofsize.pdf Some Notions of Size in Partial Semigroups] " "Topology Proceedings" 25 (2000), 317-332
* V. Bergelson, " [http://www.math.ohio-state.edu/~vitaly/vbkatsiveli20march03.pdf Minimal Idempotents and Ergodic Ramsey Theory] ", "Topics in Dynamics and Ergodic Theory 8-39, London Math. Soc. Lecture Note Series 310", Cambridge Univ. Press, Cambridge, (2003)
* V. Bergelson, N. Hindman, " [http://members.aol.com/nhfiles2/pdf/large.pdf Partition regular structures contained in large sets are abundant] ", "J. Comb. Theory (Series A)" 93 (2001), 18-36
* T. Brown, " [http://projecteuclid.org/Dienst/UI/1.0/Summarize/euclid.pjm/1102971066 An interesting combinatorial method in the theory of locally finite semigroups] ", "Pacific J. Math." 36, no. 2 (1971), 285–289.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать реферат

Look at other dictionaries:

  • Syndetic set — In mathematics, a syndetic set is a subset of the natural numbers, having the property of bounded gaps : that the sizes of the gaps in the sequence of natural numbers is bounded. DefinitionLet mathcal{P} f(mathbb{N}) denote the set of finite… …   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

  • 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

  • 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{N}, there is some n in mathbb{N} such that {n, n+1, n+2, ... , n+p } subset T.ee also*Syndetic set… …   Wikipedia

  • List of mathematics articles (P) — NOTOC P P = NP problem P adic analysis P adic number P adic order P compact group P group P² irreducible P Laplacian P matrix P rep P value P vector P y method Pacific Journal of Mathematics Package merge algorithm Packed storage matrix Packing… …   Wikipedia

  • Ergodic Ramsey theory — is a branch of mathematics where problems motivated by additive combinatorics are proven using ergodic theory.Ergodic Ramsey theory arose shortly after Endre Szemerédi s proof that a set of positive upper density contains arbitrarily long… …   Wikipedia

  • Partition regular — In mathematics, the notion of partition regularity in combinatorics is one approach to explaining when a set system is quite large.Given a set X, a collection of subsets mathbb{S} subset mathcal{P}(X) is called partition regular if for any A in… …   Wikipedia

Share the article and excerpts

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