Set Theory Commons^™

Largeness And Accessibility Of Sparse Sets, Oscar Quester

Honors Program Theses and Projects

One of the main goals in the study of Ramsey Theory is to find “order” in seemingly “random” structures. For example, Van der Waerden’s Theorem tells us that given any r-coloring of the positive integers, there will exist arbitrarily long monochromatic arithmetic progressions. The theorem places no requirement on the gap (common difference), d, of the arithmetic progression – it can be any natural number. With this in mind, we ask if we are still guaranteed arbitrarily long monochromatic arithmetic progressions when we restrict the possible values of d to some subset D ⊆ N. We also ask a similar …