D-sets in Arbitrary Semigroup
Abstract
We define the notion of D-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 D-sets is a D-set. A similar partial result has been proved for Cartesian product of infinitely many D-sets. Finally, in a commutative semigroup we deduce that D-sets (with respect to a Flner net) are C-sets.
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.