Search arXivSearch

arXiv · 1702.00284

Musical intervals under 12-note equal temperament: a geometrical interpretation

Abstract

Musical intervals in multiple of semitones under 12-note equal temperament, or more specifically pitch-class subsets of assigned cardinality ($n$-chords) are conceived as positive integer points within an Euclidean $n$-space. The number of distinct $n$-chords is inferred from combinatorics with the extension to $n=0$, involving an Euclidean 0-space. The number of repeating $n$-chords, or points which are turned into themselves during a circular permutation, $T_n$, of their coordinates, is inferred from algebraic considerations. Finally, the total number of $n$-chords and the number of $T_n$ set classes are determined. Palindrome and pseudo palindrome $n$-chords are defined and included among repeating $n$-chords, with regard to an equivalence relation, $T_n/T_nI$, where reflection is added to circular permutation. To this respect, the number of $T_n$ set classes is inferred concerning palindrome and pseudo palindrome $n$-chords and the remaining $n$-chords. The above results are reproduced within the framework of a geometrical interpretation, where positive integer points related to $n$-chords of cardinality, $n$, belong to a regular inclined $n$-hedron, $Ψ_{12}^n$, the vertexes lying on the coordinate axes of a Cartesian orthogonal reference frame at a distance, $x_i=12$, $1\le i\le n$, from the origin. Considering $Ψ_{12}^n$ as special cases of lattice polytopes, the number of related nonnegative integer points is also determined for completeness. A comparison is performed with the results inferred from group theory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. Caimmi, A. Franzon, S. Tognon. 2017-01-31. Musical intervals under 12-note equal temperament: a geometrical interpretation. https://arxiv.org/abs/1702.00284

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO