Intersective sets for sparse sets of integers

Abstract

For E ⊂ N, a subset R ⊂ N is E-intersective if for every A ⊂ E having positive upper relative density, we have R (A - A) ≠ . On the other hand, R is chromatically E-intersective if for every finite partition E=i=1k Ei, there exists i such that R (Ei-Ei)≠. When E=N, we recover the usual notions of intersectivity and chromatic intersectivity. In this article, we investigate to which extent known intersectivity results hold in the relative setting when E = P, the set of primes, or other sparse subsets of N. Among other things, we prove: -There exists an intersective set that is not P-intersective. -However, every P-intersective set is intersective. -There exists a chromatically P-intersective set which is not intersective (and therefore not P-intersective). -The set of shifted Chen primes PChen + 1 is P-intersective (and therefore intersective).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…