Piecewise syndetic set

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

A set S \sub \mathbb{N} is called piecewise syndetic if there exists a finite subset G of \mathbb{N} such that for every finite subset F of \mathbb{N} there exists an x \in \mathbb{N} such that

x+F \subset \bigcup_{n \in G} (S-n)

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

Properties

Other Notions of Largeness

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

See also

Notes

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

References

This article is issued from Wikipedia - version of the Saturday, March 19, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.