Piecewise syndetic set

From testwiki
Revision as of 13:46, 8 November 2024 by imported>Citation bot (Altered pages. Added isbn. | Use this bot. Report bugs. | Suggested by Dominic3203 | Category:Combinatorics | #UCB_Category 105/188)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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 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.