Partition regular structures contained in large sets are abundant (Q5929833)

The paper extends a result of \textit{H. Furstenberg} and \textit{E. Glasner} [Contemp. Math. 215, 197-203 (1998; Zbl 0914.54033)] who showed that whenever \(B\) is a large subset of the set of integers, calling a set large whenever it is piecewise syndetic, the set of length \(l\) arithmetic progressions lying entirely within \(B\) is large among the set of all length \(l\) arithmetic progressions. On the one hand, this result is extended to arbitrary semigroups and to partition regular structures other than arithmetic progressions. On the other hand, various other notions of largeness like, for example, the notion of central sets, of IP sets and of \(\Delta\) sets as well as the corresponding dual notions are introduced and compared, and their applicability in the context of the above-mentioned result are discussed. Similar findings are also presented, among others, for the Hales-Jewett theorem.