Higher-Order Euclidean Sets
My idea of higher-order Euclidean sets builds upon research by Godfried Toussaint, John Clough, Jack Douthett and others. As research is still underway, I won't post much here except a few preliminary results.
I gave a paper on this project at the 2024 Society of Music Theory Conference in Jacksonville, Florida. The manuscript should be ready in summer 2026. Stay tuned for more information once the paper is accepted!
Some scores and audio files
- An algorithmic composition using a family of five sets with n=128: view score
- New Clapping Music -- an amusing take on a famous rhythmic cycle: view score
Max/MSP patches, C++, and Python scripts
The project was originally scaffolded in Max/MSP, before migrating to C++ and Python. While Max/MSP is very slow, it's quite visually descriptive. This proved to be a big advantage in the early stages. Soon I realized that the number of sets this method produces is far greater than Max could ever handle. It was time to rewrite the entire algorithm in C++. This was in 2025...
In May 2026 a tremendous amount of work was done to improve the quality and efficiency of code I wrote two years ago. Additionally several Python scripts were added to graph properties of the set-space.



