Piecewise syndetic set explained

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

A set

S\subN

is called piecewise syndetic if there exists a finite subset G of

N

such that for every finite subset F of

N

there exists an

x\inN

such that

x+F\subsetcupn(S-n)

where

S-n=\{m\inN:m+n\inS\}

. Equivalently, S is piecewise syndetic if there is a constant b such that there are arbitrarily long intervals of

N

where the gaps in S are bounded by b.

Properties

\betaN

, the Stone–Čech compactification of the natural numbers.

S

is piecewise syndetic and

S=C1\cupC2\cup...\cupCn

, then for some

i\leqn

,

Ci

contains a piecewise syndetic set. (Brown, 1968)

N

with positive upper Banach density, then

A+B=\{a+b:a\inA,b\inB\}

is piecewise syndetic.[1]

Other notions of largeness

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

See also

References

Notes and References

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