{'fraction_non_alphanumeric': 0.013020833333333334, 'fraction_numerical': 0.0, 'mean_word_length': 4.833333333333333, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A simple characterization of sets satisfying the Central Sets Theorem

Central subsets of a discrete semigroup S have very strong combinatorial properties which are a consequence of the Central Sets Theorem. Call a set a C-set if it satisfies the conclusion of the Central Sets Theorem. We obtain here a reasonably simple characterization of C-sets in an arbitrary discrete semigroup.