# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Best possible results on the density of sumsets. (English) Zbl 0722.11007
Analytic number theory, Proc. Conf. in Honor of Paul T. Bateman, Urbana/IL (USA) 1989, Prog. Math. 85, 395-403 (1990).
[For the entire collection see Zbl 0711.00008.] Let $\delta$ denote the Shnirel’man density and $d\sb L$ the lower asymptotic density of sets of nonnegative integers. Using Dyson’s theorem it is shown that for every $h\in {\bbfN}$ there are sets $A\sb 1,...,A\sb h\subseteq {\bbfN}\sb 0$ such that $$\delta (C)=d\sb L(C)=\alpha\sb 1+...+\alpha\sb h\le 1$$ where $\alpha\sb i=\delta (A\sb i)=d\sb L(A\sb i)$ for $i=1,...,h$ and $C=A\sb 1+...+A\sb h$. This proves the general lower bounds for $\delta$ (C) and $d\sb L(C)$, which are given in Mann’s theorem and in the first case of Kneser’s theorem respectively, to be the best possible ones. It should be mentioned that Kneser even obtained $d\sb L(C)\ge \liminf\sb{n\to \infty}(A\sb 1(n)+...+A\sb h(n))/n=:\beta.$ Since $\beta \ge \alpha\sb 1+...+\alpha\sb h$ the result above gives $d\sb L(C)=\beta$ proving this lower bound to be sharp all the more.
##### MSC:
 11B05 Topology etc. of sets of numbers 11B13 Additive bases, including sumsets
##### Keywords:
Dyson’s theorem; Mann’s theorem; Kneser’s theorem