In additive combinatorics, the sumset (also called the Minkowski sum) of two subsets A {\displaystyle A} and B {\displaystyle B} of an abelian group G {\displaystyle G} (written additively) is defined to be the set of all sums of an element from A {\displaystyle A} with an element from B {\displaystyle B} . That is, A + B = { a + b : a ∈ A , b ∈ B } .
In additive combinatorics, the sumset (also called the Minkowski sum) of two subsets A {\displaystyle A} and B {\displaystyle B} of an abelian group G {\displaystyle G} (written additively) is defined to be the set of all sums of an element from A {\displaystyle A} with an element from B {\displaystyle B} . That is, A + B = { a + b : a ∈ A , b ∈ B } .
Source: Wikipedia "Sumset" · CC BY-SA 4.0
Share this article: X · Bluesky