In our earlier paper we gave a sharp lower-bound estimate for the cardinality of hA=A+ } } } +A (A being a finite set of integers). It appears that certain applications require this estimate to be generalized for the case of distinct summands. Below we obtain such a generalization by estimating the
Structure Theorem for Multiple Addition and the Frobenius Problem
β Scribed by Vsevolod F. Lev
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 304 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
β¦ Synopsis
Let A [0; l] be a set of n integers, and let h 2. By how much does |hA| exceed |(h&1) A| ? How can one estimate |hA| in terms of n, l ? We give sharp lower bounds extending and generalizing the well-known theorem of Freiman for |2A|. A number of applications are provided as well. In particular, we give a solution for the old extremal problem of Frobenius Erdo s Graham concerning estimating of the largest integer, non-representable by a linear form. In a sense, our solution can not be improved.
π SIMILAR VOLUMES
## Abstract We consider an initialβboundary value problem for the nonβlinear evolution equation equation image in a cylinder __Q~t~__ = Ξ© Γ (0, __t__), where __T__[__u__] = __yu~xx~__ + __u~yy~__ is the Tricomi operator and __l__(__u__) a special differential operator of first order. In [10] we p
New uniform estimates for multigrid algorithms are established for certain non-symmetric indefinite problems. In particular, we are concerned with the simple additive algorithm and multigrid (V(1, 0)-cycle) algorithms given in [5]. We prove, without full elliptic regularity assumption, that these al
The aim of this paper is to show the existence of metrics gΓ = on S n , where gΓ = is a perturbation of the standard metric gΓ 0 , for which the Yamabe problem possesses a sequence of solutions unbounded in L (S n ). The metrics gΓ = that we find are of class C k on S n with (k n&3 4 ). We also prov