From Surf Wiki (app.surf) — the open knowledge base
Syndetic set
Type of subset of the natural numbers
Type of subset of the natural numbers
In mathematics, a syndetic set is a subset of the natural numbers having the property of "bounded gaps": that the sizes of the gaps in the sequence of natural numbers is bounded.
Definition
A set S \sub \mathbb{N} is called syndetic if for some finite subset F of \mathbb{N}
:\bigcup_{n \in F} (S-n) = \mathbb{N}
where S-n = {m \in \mathbb{N} : m+n \in S }. Thus syndetic sets have "bounded gaps"; for a syndetic set S, there is an integer p=p(S) such that [a, a+1, a+2, ... , a+p] \bigcap S \neq \emptyset for any a \in \mathbb{N}.
References
- {{cite journal
- {{cite book
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Syndetic set — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report