D-sets in Arbitrary Semigroup
arXiv:1902.09622 · doi:10.1016/j.topol.2020.107329
Abstract
We define the notion of -set in an arbitrary semigroup, and with some mild restrictions we establish its dynamical and combinatorial characterizations. Assuming a weak form of cancellation in semigroups we have shown that the Cartesian product of finitely many -sets is a -set. A similar partial result has been proved for Cartesian product of infinitely many -sets. Finally, in a commutative semigroup we deduce that -sets (with respect to a Følner net) are -sets.
17 pages