2000 character limit reached
Iterative method of construction of good rhythms
Published 6 Nov 2017 in math.CO | (1711.01734v1)
Abstract: On the space of rhythms of arbitrary length with a fixed number of onsets, a self map $F$ is constructed. It is shown that for any rhythm $\mathbf{r}$ of the space there exists a nonnegative integer $k$ such that $Fk(\mathbf{r})$ falls into the category of "maximally even rhythms" investigated in [1].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.