Sum-intersective sets
A subset \(S\) of the natural numbers is said to have no sum-intersective property if there is a set \(A\) with lower density \(1/2\) and \(A+A\) is disjoint from \(S\). In this paper the author shows that if the counting function of \(S\) satisfies \(S(n)=o(\log n)\) then \(S\) has no sum-intersective property. Moreover, it is shown that the result is best possible. Along the lines, a question by Erdős about the sum-intersective property of ``residues regular sets is answered. The proofs make use of the distribution of \((\alpha n)\) mod 1, Parseval's formula and Dirichlet's approximation theorem.
- On sum-intersective sets
- scientific article; zbMATH DE number 2212148
- Sumsets as unions of sumsets of subsets
- scientific article; zbMATH DE number 746096
- Set-Theoretic Complete Intersections
- scientific article; zbMATH DE number 66762
- scientific article; zbMATH DE number 5663738
- Intersection theorems for multisets
- Sum of sets in several dimensions
- scientific article; zbMATH DE number 953255
- A concentration function estimate and intersective sets from matrices
- Intersections of shifted sets
- scientific article; zbMATH DE number 3873442 (Why is no real title available?)
- scientific article; zbMATH DE number 3641573 (Why is no real title available?)
- scientific article; zbMATH DE number 726992 (Why is no real title available?)
- Sumsets as unions of sumsets of subsets
- Intersection properties of subsets of integers
- On some properties of sparse sets: a survey
- On measures of intersectivity
- On sum-intersective sets
This page was built for publication: Sum-intersective sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380759)