On the number of sums and products (Q4369691)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1100474
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of sums and products |
scientific article; zbMATH DE number 1100474 |
Statements
On the number of sums and products (English)
0 references
8 January 1998
0 references
upper bounds
0 references
number of products
0 references
number of sums of sets
0 references
0 references
0 references
0 references
0.9485579
0 references
0 references
0 references
Sei \(A\) eine endliche Menge reeller Zahlen \(\neq 0\). Ferner bedeutet \(A+A: = \{a+a' \mid a,a' \in A\}\) und \(A\cdot A= \{a\cdot a'\mid a,a' \in A\}\). Als Verbesserung eines Resultats von Nathanson und K. Ford wird gezeigt, daß es eine Konstante \(c>0\) gibt, so daß für alle \(n\)-elementigen Mengen \(A\) gilt \[ c\cdot n^{5\over 4} \leq\max \bigl\{|A+A |,|A \cdot A|\bigr\}. \] Zum Beweis wird eine geometrische Argumentation benutzt.
0 references
