SearcharxivSearch

arXiv · 0909.0039

About the number of generators of a musical scale

Abstract

Several musical scales, like the major scale, can be described as finite arithmetic sequences modulo octave, i.e. chunks of an arithmetic sequence in a cyclic group. Hence the question of how many different arithmetic sequences in a cyclic group will give the same support set. We prove that this number is always a totient number and characterize the different possible cases. In particular, there exists scales with an arbitrarily large number of different generators, but none with 14 generators. Some connex results and extensions are also given, for instance on characterization via a Discrete Fourier Transform, and about finite or infinite arithmetic sequences in the torus R/Z.

Explore related subjects

Keep this discovery

BibTeXRIS

Emmanuel Amiot. 2009-08-31. About the number of generators of a musical scale. https://arxiv.org/abs/0909.0039

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR