Sets arising as minimal additive complements in the integers
نویسندگان
چکیده
A subset C of an abelian group G is said to be a minimal additive complement W⊆G if C+W=G and C′+W≠G for any proper C′⊂C. In this paper, we study certain subsets the integers that arise or do not as complements. Following suggestion Kwon, show bounded-below sets with arbitrarily large gaps Moreover, our construction shows such set belongs co-minimal pair, strengthening result Biswas Saha lacunary sequences in integers. We bound upper lower Banach density syndetic complements finite sets. provide some necessary conditions eventually periodic demonstrate these are also sufficient classes conclude several conjectures questions concerning structure
منابع مشابه
On additive partitions of sets of positive integers
Consider any set U = (u,,} with elements defined by u,, +? = u,, +, + u,,, n z 1, where u, and u2 are relatively prime positive integers. We show that if u, Cu, or 2 ( u,uz, then the set of positive integers can be partitioned uniquely into two disjoint sets such that the sum of any two distinct memhers of any one set is never in U. If U,>LQ and 21 u,uz. no such partition is possible. Further r...
متن کاملFinite Sets as Complements of Finite Unions of Convex Sets
Suppose S ⊆ R is a set of (finite) cardinality n whose complement can be written as the union of k convex sets. It is perhaps intuitively appealing that when n is large k must also be large. This is true, as is shown here. First the case in which the convex sets must also be open is considered, and in this case a family of examples yields an upper bound, while a simple application of a theorem ...
متن کاملAn Algorithm for Packing Complements of F in Ite Sets of Integers
Let Ak = {0 = a1 < a2 < ... < ak} and B = {0 = b1 < b2 < ... < bn ...} be sets of k integers and infinitely many integers, respectively. Suppose B has asymptotic density x t d(B) x. If, for every integer n _> 0, there is at most one representation n a^ + bj , then we say that Ak has a packing complement of density j> x. Given Ak and x9 there is no known algorithm for determining whether or not ...
متن کاملOn the additive complements of the primes and sets of similar growth
1. We prove that there is a set of nonnegative integers A, with counting function A(x) = #(A \ 1; x]) satisfying A(x) C log x loglogx; C a positive constant; such that N = (A + P) E, with N and Pdenoting the positive integers and the primes respectively and with the set E having upper density 0. That is, A is \almost" an additive complement of the primes and at the same time it has few elements...
متن کاملcounterexamples in a−minimal sets
several tables have been given due to a − minimal sets. our main aim in this paper is tocomplete these tables by employing several examples.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2023
ISSN: ['0022-314X', '1096-1658']
DOI: https://doi.org/10.1016/j.jnt.2022.12.001