Paper by Erik D. Demaine

Reference:

Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz Taslakian, Godfried T. Toussaint, Terry Winograd, and David R. Wood, “The Distance Geometry of Music”, Computational Geometry: Theory and Applications, volume 42, number 5, July 2009, pages 429–454. Special issue of selected papers from the 17th Canadian Conference on Computational Geometry, 2005.

BibTeX

@Article{DeepRhythms_CGTA,
  AUTHOR        = {Erik D. Demaine and Francisco Gomez-Martin and Henk Meijer
                   and David Rappaport and Perouz Taslakian and
                   Godfried T. Toussaint and Terry Winograd and David R. Wood},
  TITLE         = {The Distance Geometry of Music},
  JOURNAL       = {Computational Geometry: Theory and Applications},
  journalurl    = {https://www.sciencedirect.com/journal/computational-geometry},
  VOLUME        = 42,
  NUMBER        = 5,
  MONTH         = {July},
  YEAR          = 2009,
  PAGES         = {429--454},
  NOTE          = {Special issue of selected papers from the
                   17th Canadian Conference on Computational Geometry, 2005.},

  papers        = {DeepRhythms_CCCG2005},
  replaces      = {DeepRhythms_CCCG2005},
  length        = {39 pages},
  category      = {art},
  doi           = {https://dx.doi.org/10.1016/J.COMGEO.2008.04.005},
  dblp          = {https://dblp.org/rec/journals/comgeo/DemaineGMRTTWW09},
  comments      = {This paper is also available from <A HREF="http://dx.doi.org/10.1016/j.comgeo.2008.04.005">ScienceDirect</A> and as <A HREF="https://arXiv.org/abs/0705.4085">arXiv:0705.4085</A>.},
}

Abstract:

We demonstrate relationships between the classical Euclidean algorithm and many other fields of study, particularly in the context of music and distance geometry. Specifically, we show how the structure of the Euclidean algorithm defines a family of rhythms that encompass over forty timelines (ostinatos) from traditional world music. We prove that these Euclidean rhythms have the mathematical property that their onset patterns are distributed as evenly as possible: they maximize the sum of the Euclidean distances between all pairs of onsets, viewing onsets as points on a circle. Indeed, Euclidean rhythms are the unique rhythms that maximize this notion of evenness. We also show that essentially all Euclidean rhythms are deep: each distinct distance between onsets occurs with a unique multiplicity, and these multiplicities form an interval 1, 2, …, k − 1. Finally, we characterize all deep rhythms, showing that they form a subclass of generated rhythms, which in turn proves a useful property called shelling. All of our results for musical rhythms apply equally well to musical scales. In addition, many of the problems we explore are interesting in their own right as distance geometry problems on the circle; some of the same problems were explored by Erdős in the plane.

Comments:

This paper is also available from ScienceDirect and as arXiv:0705.4085.

Length:

The paper is 39 pages.

Availability:

The paper is available in PostScript (1930k), gzipped PostScript (809k), and PDF (453k).

See information on file formats.

[Google Scholar search]

Related papers:

DeepRhythms_CCCG2005 (The Distance Geometry of Deep Rhythms and Scales)