Exhibition of piecewise syndetic and broken IP sets near idempotent
Ujjal Kumar Hom, Manoranjan Singha

TL;DR
This paper characterizes various special sets in semigroups using ultrafilters and explores their properties near idempotents, providing new insights into recurrence and structure without countability assumptions.
Contribution
It introduces novel characterizations of piecewise syndetic and broken IP sets via ultrafilters and extends results to non-countable semigroups near idempotents.
Findings
Characterization of ultrafilters in the smallest ideal using syndetic and central sets
Representation of piecewise syndetic sets containing broken A sets
Equivalence between sets containing broken IP and broken IP^n sets
Abstract
Characterizations of ultrafilters belong to the smallest ideal of Stone-\v{C}ech compactification of a discrete semigroup are exhibited using syndetic sets, strongly central sets and very strongly central sets respectively. These lead to represent piecewise syndetic sets of a semigroup in terms of the sets that contain a broken set, where syndetic, quasi-central, central, strongly central, very strongly central. Also, a characterization of broken IP sets using ultrafilters, and the equivalence between the sets that contain a broken IP set and sets that contain a broken IP are established, . Without assuming the countability of a semigroup, it is shown that piecewise syndetic sets i.e., sets that contain a broken syndetic set (broken IP set) force uniform recurrence (recurrence respectively) and vice versa. In addition,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · VLSI and Analog Circuit Testing · semigroups and automata theory
