The study of recursively invariant properties of sets of integers was initiated, in large part, in the 1944paper of POST [l]. Various notions of reducibility, redefined below, are introduced in that paper ; and a set is called complete with respect to a given reducibility if (i) it is recursively en
Bases for sets of integers
✍ Scribed by P Erdös; D.J Newman
- Publisher
- Elsevier Science
- Year
- 1977
- Tongue
- English
- Weight
- 332 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0022-314X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For a set of integers A Z and k51 the k-deck of A is the function d A;k defined on sets S of k integers by Our main result is that for k53; a set for which the k-deck only takes finite values is determined up to translation by its k-deck and one finite non-zero value of its ðk À 1Þdeck. This genera
This paper deals with the problem of finding the maximal density, +(M), of sets of integers in which differences given by a set M do not occur. The problem is solved for the case where the elements of M are in arithmetic progression. Besides finding lower bounds for most members of the general three