In mathematics, the Davenport constant D ( G ) {\displaystyle D(G)} is an invariant of a group studied in additive combinatorics, quantifying the size of nonunique factorizations. Given a finite abelian group G {\displaystyle G} , D ( G ) {\displaystyle D(G)} is defined as the smallest number such that every sequence of elements of that length contains a non-empty subsequence adding up to 0.
In mathematics, the Davenport constant D ( G ) {\displaystyle D(G)} is an invariant of a group studied in additive combinatorics, quantifying the size of nonunique factorizations. Given a finite abelian group G {\displaystyle G} , D ( G ) {\displaystyle D(G)} is defined as the smallest number such that every sequence of elements of that length contains a non-empty subsequence adding up to 0.
Source: Wikipedia "Davenport constant" · CC BY-SA 4.0
Share this article: X · Bluesky