Course-of-values recursion

From formulasearchengine
Jump to navigation Jump to search

In mathematics, piecewise syndeticity is a notion of largeness of subsets of the natural numbers.

A set S is called piecewise syndetic if there exists a finite subset G of such that for every finite subset F of there exists an x such that

x+FnG(Sn)

where Sn={m:m+nS}. Equivalently, S is piecewise syndetic if there are arbitrarily long intervals of where the gaps in S are bounded by some constant b.

Properties

  • 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 β, the Stone–Čech compactification of the natural numbers.

Other Notions of Largeness

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

See also

Notes

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

References

  1. R. Jin, Nonstandard Methods For Upper Banach Density Problems, Journal of Number Theory 91, (2001), 20-38</math>.