Additive and multiplicative structure of c-sets

Abstract

It is known that for an IP set A in N and a sequence < xn>n=1∞ there exists a sum subsystem < yn>n=1∞ of < xn>n=1∞ such that FS(< yn>n=1∞) FP(< yn>n=1∞)⊂eq A. Similar types of results also have been proved for central* sets where the sequences have been taken from the class of minimal sequences. In this present work we will prove some analogues results for C-sets for a more general class of sequences.

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…