Preservation of notion of C sets near zero over reals

Abstract

There are several notions of largeness in a semigroup. N. Hindman and D. Strauss established that if u,v ∈ N, A is a u × v matrix with entries from Q and is a notion of a large set in N, then \x ∈ Nv: Ax ∈ u \ is large in Nv. Among the several notions of largeness, C sets occupies an important place of study because they exhibit strong combinatorial properties. The analogous notion of C set appears for a dense subsemigroup S of ((0, ∞),+) called a C-set near zero. These sets also have very rich combinatorial structure. In this article, we investigate the above result for C sets near zero in R+ when the matrix has real entries. We also develop a new characterisation of C-sets near zero in R+.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…