English

Recurrence in a dynamical system over adequate partial semigroups

Combinatorics 2026-07-29 v1

Abstract

Using tools from topological dynamics, H.~Furstenberg introduced the notion of \emph{central sets} and established the celebrated Central Sets Theorem. The sets which satisfy the conclusion of the Central Sets Theorem are called CC-sets. Hindman, Maleki, and Strauss first brought the concept of an important type of CC-sets called the quasi-central sets which are not central sets. In 2017, A. Ghosh gave the combinatorial treatment of CC-sets in commutative adequate partial semigroups, where CC-sets are the sets which satisfy the conclusion of Central Sets Theorem for commutative adequate partial semigroups. In this work, we discuss the Quasi-central sets algebraically and dynamically for commutative adequate partial semigroups. We give dynamical characterization of members of idempotent ultrafilters for commutative adequate partial semigroups, also we study the minimal dynamical systems for an adequate partial semigroup.

Cite

@article{arxiv.2607.26548,
  title  = {Recurrence in a dynamical system over adequate partial semigroups},
  author = {Md Moid Shaikh and Shivam Kumar and Sourav Kanti Patra},
  journal= {arXiv preprint arXiv:2607.26548},
  year   = {2026}
}