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
随便看	Nonenal nonenantiomeric nonenantioselective nonencapsulated nonencapsulated nerve glomeruli nonencapsulated nerve glomerulus Nonencapsulated sclerosing adenocarcinoma Nonencapsulated sclerosing carcinoma Nonencapsulated sclerosing tumor non encapsulated winding dry type transformer nonenclosed nonencoded nonencoded keyboard nonencounter nonencounters nonencrypted nonendangered non endemic nonendemic nonendemic disease nonending nonendioic acid nonendless belt non endless belt nonendocrine