{'fraction_non_alphanumeric': 0.06607142857142857, 'fraction_numerical': 0.007142857142857143, 'mean_word_length': 4.783505154639175, 'pattern_counts': {'":': 0, '<': 6, '<?xml version=': 0, '>': 6, '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}}
On the Generation of (Minimal) Clones Containing Near-Unanimity Operations

For a clone C that contains a near-unanimity operation, one can define λ(C) and μ(C) to be the smallest integers k<sub>1</sub> and k<sub>2</sub> such that C is generated by its k1-ary part and can be written as the set of polymorphisms of its k<sub>2</sub>-th graphic, respectively. In this paper, we discuss the meaning of the functions λ and μ, elaborate the connection between them, derive some (sharp) bounds, and calculate the functions values for some selected (minimal) clones.