Wir verwenden Cookies und Analyse-Tools, um die Nutzerfreundlichkeit der Internet-Seite zu verbessern und für Marketingzwecke. Wenn Sie fortfahren, diese Seite zu verwenden, nehmen wir an, dass Sie damit einverstanden sind. Zur Datenschutzerklärung.
Sumset
CHF 43.20
Auf Lager
SKU
8SF1UEBTUP9
1 Verfügbar 
Geliefert zwischen Mi., 26.11.2025 und Do., 27.11.2025
Details
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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, A + B = {a+b : a in A, b in B}. The n-fold iterated sumset of A is nA = A + cdots + A where there are n summands. Many of the questions and results of additive combinatorics and additive number theory can be phrased in terms of sumsets. For example, Lagrange''s four-square theorem can be written succinctly in the form 4A = mathbb{N} where A is the set of square numbers. A subject that has received a fair amount of study is that of sets with small doubling, where the size of the set A+A is small (compared to the size of A); see for example Freiman''s theorem.
Weitere Informationen
- Allgemeine Informationen
- GTIN 09786131235214
- Editor Lambert M. Surhone, Mariam T. Tennoe, Susan F. Henssonow
- Größe H220mm x B220mm
- EAN 9786131235214
- Format Fachbuch
- Titel Sumset
- Herausgeber Betascript Publishing
- Anzahl Seiten 80
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
