AbstractA Theorem of M. Kneser relating densities of sumsets to densities of their summands (see [H. Halberstam and K. F. Roth, "Sequences," Chap. 1. Oxford Univ. Press, Oxford], 1966]) is used to set up a machine for settling questions regarding the generalized form of Waring′s problem in additive number theory. For example, if a strictly increasing sequence of integers represents all sufficiently large integers by ternary sums, and an element is removed from the sequence such that the terms remaining represent all sufficiently large integers by sums of some fixed number of terms, then that fixed number is at most seven and this result is best possible
AbstractA well-known theorem of Erdös and Fuchs states that we cannot have too good an asymptotic fo...
International audienceIn this paper some links between the density of a set of integers and the dens...
For a sequence S of terms from an abelian group G of length |S|, let Σ n(S) denote the set of all el...
AbstractA Theorem of M. Kneser relating densities of sumsets to densities of their summands (see [H....
AbstractLet A=(A1,…,Am) be a sequence of finite subsets from an additive abelian group G. Let Σℓ(A) ...
Let A = (A1,..., Am) be a sequence of finite subsets from an additive abelian group G. Let \Sigma `(...
The last few years have seen the development and improvement of structural results in the area of se...
This dissertation focuses on three problems in analytic number theory, one of a multiplicative natur...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
Let A = (A1,...,Am) be a sequence of finite subsets from an additive abelian group G. Let Σ ℓ (A) de...
We reduce the number of variables required to guarantee the validity of the classical asymptotic for...
Combinatorial methods are used to prove several results in number theory. The chapters may be read i...
We state and discuss various problems in the general area of arithmetic combinatorics and recent dev...
ABSTRACT. We explicitly construct infinite families of MSTD (more sums than differ-ences) sets, i.e....
Graduation date: 1971In this thesis we investigate the extension of certain theorems\ud of additive ...
AbstractA well-known theorem of Erdös and Fuchs states that we cannot have too good an asymptotic fo...
International audienceIn this paper some links between the density of a set of integers and the dens...
For a sequence S of terms from an abelian group G of length |S|, let Σ n(S) denote the set of all el...
AbstractA Theorem of M. Kneser relating densities of sumsets to densities of their summands (see [H....
AbstractLet A=(A1,…,Am) be a sequence of finite subsets from an additive abelian group G. Let Σℓ(A) ...
Let A = (A1,..., Am) be a sequence of finite subsets from an additive abelian group G. Let \Sigma `(...
The last few years have seen the development and improvement of structural results in the area of se...
This dissertation focuses on three problems in analytic number theory, one of a multiplicative natur...
We prove results in arithmetic combinatorics involving sums of prime numbers and also some variants ...
Let A = (A1,...,Am) be a sequence of finite subsets from an additive abelian group G. Let Σ ℓ (A) de...
We reduce the number of variables required to guarantee the validity of the classical asymptotic for...
Combinatorial methods are used to prove several results in number theory. The chapters may be read i...
We state and discuss various problems in the general area of arithmetic combinatorics and recent dev...
ABSTRACT. We explicitly construct infinite families of MSTD (more sums than differ-ences) sets, i.e....
Graduation date: 1971In this thesis we investigate the extension of certain theorems\ud of additive ...
AbstractA well-known theorem of Erdös and Fuchs states that we cannot have too good an asymptotic fo...
International audienceIn this paper some links between the density of a set of integers and the dens...
For a sequence S of terms from an abelian group G of length |S|, let Σ n(S) denote the set of all el...