{"paper":{"title":"Recurrence in a dynamical system over adequate partial semigroups","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Md Moid Shaikh, Shivam Kumar, Sourav Kanti Patra","submitted_at":"2026-07-29T07:19:51Z","abstract_excerpt":"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 $C$-sets. Hindman, Maleki, and Strauss first brought the concept of an important type of $C$-sets called the quasi-central sets which are not central sets. In 2017, A. Ghosh gave the combinatorial treatment of $C$-sets in commutative adequate partial semigroups, where $C$-sets are the sets which satisfy the conclusion of Central Sets Theorem for commutative adequate pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26548","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.26548/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}