An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

In mathematics, piecewise syndeticity is a notion of largeness of subsets of the natural numbers. A set is called piecewise syndetic if there exists a finite subset G of such that for every finite subset F of there exists an such that where . 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.

Property Value
dbo:abstract
  • In mathematics, piecewise syndeticity is a notion of largeness of subsets of the natural numbers. A set is called piecewise syndetic if there exists a finite subset G of such that for every finite subset F of there exists an such that where . 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. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 3994836 (xsd:integer)
dbo:wikiPageLength
  • 3615 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1110744923 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In mathematics, piecewise syndeticity is a notion of largeness of subsets of the natural numbers. A set is called piecewise syndetic if there exists a finite subset G of such that for every finite subset F of there exists an such that where . 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. (en)
rdfs:label
  • Piecewise syndetic set (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License