Piecewise syndetic set

From testwiki
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+F⊂⋃n∈G(S−n)

where S−n={m∈ℕ:m+n∈S}. Equivalently, S is piecewise syndetic if there is a constant b such that there are arbitrarily long intervals of ℕ where the gaps in S are bounded by b.

Properties

Other notions of largeness

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

See also

Notes

Template:Reflist

References

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