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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.