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

In mathematics, the Davenport constant D(G) is an invariant of a group studied in additive combinatorics, quantifying the size of nonunique factorizations. Given a finite abelian group G, D(G) is defined as the smallest number such that every sequence of elements of that length contains a non-empty sub-sequence adding up to 0. In symbols, this is .

Property Value
dbo:abstract
  • In mathematics, the Davenport constant D(G) is an invariant of a group studied in additive combinatorics, quantifying the size of nonunique factorizations. Given a finite abelian group G, D(G) is defined as the smallest number such that every sequence of elements of that length contains a non-empty sub-sequence adding up to 0. In symbols, this is . (en)
dbo:wikiPageID
  • 38308766 (xsd:integer)
dbo:wikiPageLength
  • 7286 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1061837902 (xsd:integer)
dbo:wikiPageWikiLink
dbp:author
  • Hutzler, Nick (en)
dbp:date
  • August 2018 (en)
dbp:id
  • DavenportConstant (en)
  • p/d110010 (en)
dbp:reason
  • What is r? (en)
dbp:title
  • Davenport Constant (en)
  • Davenport constant (en)
dbp:wikiPageUsesTemplate
dcterms:subject
rdfs:comment
  • In mathematics, the Davenport constant D(G) is an invariant of a group studied in additive combinatorics, quantifying the size of nonunique factorizations. Given a finite abelian group G, D(G) is defined as the smallest number such that every sequence of elements of that length contains a non-empty sub-sequence adding up to 0. In symbols, this is . (en)
rdfs:label
  • Davenport constant (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
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