Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2601.02271

In Search of the Canonical Harmony for 12-TET

Pawel Nurowski
View original source ↗Read source document ↗Export metadata ↓

Abstract

Is the specific structure of Western tonal harmony a physical inevitability derived from acoustics, or is it merely one solution among many in a purely algebraic landscape? In this paper, we strip away the physics of vibrating strings and treat harmony as the solution to a simple linear system within the cyclic group $\mathbb{Z}_{12}$. By defining a harmonic system as a partitioning of a generator interval (the "Fifth") into two complementary thirds, we derive a complete classification of all possible harmonic universes in 12-Tone Equal Temperament. We show that every such system corresponds to a specific topological structure, visualized via its Levi graph. Our analysis reveals a counter-intuitive fact: the topological structure of standard Western harmony is not unique. It is one of exactly twelve mathematically isomorphic systems. However, we demonstrate that these shadows are not created equal. We identify a "privileged quartet" of systems that preserve the global connectivity of the Circle of Fifths. Furthermore, by invoking the Chinese Remainder Theorem, we present a compelling argument that the most number-theoretically natural system in $\mathbb{Z}_{12}$ is not the Western one, but a specific "alien" system defined by the partition $(9,4)$. This classification provides a rigorous mathematical foundation for neo-Riemannian theory and offers composers a precise "translation map" to explore syntactically familiar, yet sonically distinct, harmonic worlds.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pawel Nurowski. 2026-02-21. In Search of the Canonical Harmony for 12-TET. https://arxiv.org/abs/2601.02271

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗