{'fraction_non_alphanumeric': 0.019230769230769232, 'fraction_numerical': 0.0, 'mean_word_length': 5.2967032967032965, '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}}
Structural properties of Euclidean rhythms

In this paper we investigate the structure of Euclidean rhythms and show that a Euclidean rhythm is formed of a pattern, called the main pattern, repeated a certain number of times, followed possibly by one extra pattern, the tail pattern. We thoroughly study the recursive nature of Euclidean rhythms when generated by Bjorklund's algorithm, one of the many algorithms that generate Euclidean rhythms. We make connections between Euclidean rhythms and Bezout's theorem. We also prove that the decomposition obtained is minimal.