Sumset

In additive combinatorics, the sumset (also called the Minkowski sum) of two subsets A and B of an abelian group G (written additively) is defined to be the set of all sums of an element from A with an element from B. That is,

The n-fold iterated sumset of A is

单词	Sumset
释义	Sumset 英语百科 Sumset In additive combinatorics, the sumset (also called the Minkowski sum) of two subsets A and B of an abelian group G (written additively) is defined to be the set of all sums of an element from A with an element from B. That is, The n-fold iterated sumset of A is
随便看	result element的意思 resulteth的意思 result exponent的意思 result expression的意思 result feedback的意思 result field的意思 result from的意思 result from sth的意思 resultful的意思 result的意思 result function的意思 result generation的意思 result generation module的意思 result id的意思 result identifier的意思 result identifiler的意思 result in的意思 result indicator register的意思 result in failure的意思 resulting的意思 resulting deduction的意思 resulting display的意思 resulting fluid的意思 resulting force的意思 resulting force curve的意思