No label defined (Q4256482)
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 1315267
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1315267 |
Statements
13 July 1999
0 references
additive number theory
0 references
sumsets
0 references
product sets
0 references
inverse theorems
0 references
Freiman's theorem
0 references
divisors
0 references
0.8409126400947571
0 references
0.8306171894073486
0 references
0.8159588575363159
0 references
0.8139275908470154
0 references
Let \(A\) be a finite set of integers, \( |A |=k\), such that the number of sums \(a_1+a_2: a_1, a_2\in A\) is at most \(3k-4\). It is shown that in this case the number of different products \(a_1a_2\) is at least \( c ( k/ \log k)^2\). A similar result is shown for two different sets, provided the quotient of their cardinalities stays between positive bounds. The proof starts by recalling a theorem of G. Freiman, which yields that \(A\) is contained in a short arithmetical progression. Then the number of coincidences in the products taken from arithmetical progressions is estimated. For the entire collection see [Zbl 0919.00044].
0 references