On Sum Sets of Sidon Sets, 1.
β Scribed by P. Erdos; A. Sarkozy; T. Sos
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 452 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A subset of the natural numbers is k-sum-free if it contains no solutions of the equation x 1 + } } } +x k = y, and strongly k-sum-free when it is l-sum-free for every l=2, ..., k. It is shown that every k-sum-free set with upper density larger than 1Γ(k+1) is a subset of a periodic k-sum-free set a
The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C(v, k, t). In this article, a computer search for finding good such covering designs, leading to new upper bounds on C(v, k, t), is considered. The search is facilitated by predeterm
Consider the problem of recovering a set of real numbers X from the knowledge of its unlabeled set of differences xi --q > xi , xj E x, 1 <z.,j<N. (1) This problem comes up in different setups, among them in the so-called "phase problem in crystallography"; see [3] and the references given there.
If \(\left(X_{k}\right)_{k=1}^{x}\) is a sequence of independent random variables with probabilities of atoms bounded away from one and \(E\) is a Borel linear subspace of \(\mathbb{R}^{x}\), then the event \(\left\{\left(X_{k}\right)_{k=1}^{X} \in E\right\}\) is a.s. equivalent to the event \(\left