This HTML5 document contains 27 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n13http://www.emis.de/journals/DM/
n11https://global.dbpedia.org/id/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Barycentric-sum_problem
rdfs:label
Barycentric-sum problem
rdfs:comment
Combinatorial number theory deals with number theoretic problems which involve combinatorial ideas in their formulations or solutions. Paul Erdős is the main founder of this branch of number theory. Typical topics include covering system, zero-sum problems, various restricted sumsets, and arithmetic progressions in a set of integers. Algebraic or analytic methods are powerful in this field. In combinatorial number theory, the barycentric-sum problems are questions that can be answered using combinatorial techniques. The context of barycentric-sum problems are the barycentric sequences.
dcterms:subject
dbc:Combinatorics
dbo:wikiPageID
16668496
dbo:wikiPageRevisionID
1086357042
dbo:wikiPageWikiLink
dbr:Combinatorics dbr:Abelian_group dbc:Combinatorics dbr:Combinatorial_number_theory dbr:Number_theory dbr:Ramsey_numbers dbr:Paul_Erdős dbr:Restricted_sumset dbr:Zero-sum_problem dbr:Covering_system dbr:Arithmetic_progression
dbo:wikiPageExternalLink
n13:
owl:sameAs
freebase:m.03ykt9w n11:4VxpL wikidata:Q4865996
dbo:abstract
Combinatorial number theory deals with number theoretic problems which involve combinatorial ideas in their formulations or solutions. Paul Erdős is the main founder of this branch of number theory. Typical topics include covering system, zero-sum problems, various restricted sumsets, and arithmetic progressions in a set of integers. Algebraic or analytic methods are powerful in this field. In combinatorial number theory, the barycentric-sum problems are questions that can be answered using combinatorial techniques. The context of barycentric-sum problems are the barycentric sequences.
prov:wasDerivedFrom
wikipedia-en:Barycentric-sum_problem?oldid=1086357042&ns=0
dbo:wikiPageLength
6048
foaf:isPrimaryTopicOf
wikipedia-en:Barycentric-sum_problem
Subject Item
dbr:Barycentric_sum_problem
dbo:wikiPageWikiLink
dbr:Barycentric-sum_problem
dbo:wikiPageRedirects
dbr:Barycentric-sum_problem
Subject Item
wikipedia-en:Barycentric-sum_problem
foaf:primaryTopic
dbr:Barycentric-sum_problem