Search arXivSearch

arXiv · 2606.11246

Nineteen to the Dozen: Embedding the Neo-Riemannian Tonnetz into a Cyclic 19_3 Symmetric Configuration

Abstract

This paper bridges combinatorial geometry and music theory to solve the fundamental challenge of embedding classical Western harmony into the microtonal 19-tone equal temperament (19-TET). Inspired by Roger Penrose's observations on the mathematical elegance of 19-TET, we provide the theoretical foundation for a physical 19-TET acoustic piano currently under construction. However, playing classical 12-TET music on such an instrument poses a topological problem: emvedding the classical Euler-Riemann Tonnetz into the 19-TET universe inevitably distorts structural chords, creating dissonant ``wolves.'' By formalizing these harmonic spaces as incidence configurations (the 12_3 and 19_3 graphs) and utilizing integer cuts in our optimization model, we exhaustively prove that exactly 32 out of 36 Neo-Riemannian harmonic connections can be preserved. We demonstrate a strict 5-fold degeneracy of this optimum: there exist exactly 5 mathematically equivalent local packings for the wolf chords. Among these, we identify a unique canonical realization in which the 14 excised vertices form a perfectly contiguous geometric void along the primary Hamiltonian cycle. We reveal that the 4 inevitably broken edges represent the exact topological scars of the historical enharmonic diesis, and we formulate the Vicentino Hypothesis regarding 16th-century microtonal composition. Finally, to make this theoretical geometry physically playable, we design a novel 19-TET split-key keyboard, formalized through a biomechanical cost function that optimizes the performer's hand span. This work provides the complete theoretical, historical, and ergonomic blueprint for the next generation of microtonal acoustic instruments.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pawel Nurowski. 2026-06-06. Nineteen to the Dozen: Embedding the Neo-Riemannian Tonnetz into a Cyclic 19_3 Symmetric Configuration. https://arxiv.org/abs/2606.11246

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

KEEP EXPLORING

Related papers

The new Fermat-type factorization algorithm

Let n be any odd natural number other than a perfect square. We show that the new factorization algorithm, presented in this paper and which we call DFM-1 (where DFM stands for Detto's Factorization Method), is much more efficient than the implementation technique of Fermat's Factorization Algorithm (FFA) called FFA-1, which, among the implementation techniques of Fermat's Factorization Algorithm (FFA), is the one that requires the fewest iterations to identify the non-trivial and trivial factors of n (excluding the cases in which the two factors of the pair of non-trivial or trivial factors of n are so close to each other that they can be identified at the 1st iteration with each of such implementation techniques). Indeed, by the way in which Euler's totient function of any n that is a semiprime is applied to FFA-1, we arrive at the new factorization algorithm (DFM-1), which halves (possibly rounding up to the next integer) the number of iterations required by FFA-1. Furthermore, in this paper, we present the hypothetical scenario according to which the number of iterations could possibly be further reduced. Finally, and still in relation to this new factorization algorithm, in this paper we present the limit number of iterations, which is less than the number of iterations required by DFM-1 to reach the condition x - y = 1 which characterizes the pair of trivial factors of n, beyond which it is no longer possible for pairs of non-trivial factors of n to occur.

math.GM

A Note on the Measure of Vector and Pythagorean Theorem

Why the square? We present a geometry-axiom-free derivation of the Pythagorean theorem and the square at its core, establishing their algebraic origin from within the bare vector-space framework. Such concepts as the (right) angle, rotation, inner product, orthogonality etc also emerge as a logical construct rather than taken as given. They are necessitated by the square, and the ensuing theory, in turn, $\textit{canonically}$ stems from a $\textit{single}$ definitional primitive $-$ the ($\mathbb R^{\vcenter{\hbox{$\scriptscriptstyle+$}}}\!$-quantitative) invariant $\mathcal Q$-measure of a vector. This provides the core of an algebraic justification for Euclidean geometry. Equally important, these findings account (also canonically) for the complex modulus-squared $p = |\mathfrak a|^2$ $-$ the quantum Born rule $-$ and point out what is even admissible for being quantitatively interpreted. The linear structure and its endomorphisms are rigid in the sense that the $\textit{well-defined}$ interpretable turns out to be, up to gauge $\mathcal Q {\,\to\,} \mathrm{const} {\,\vcenter{\hbox{$\scriptstyle\times$}}\,} \mathcal Q$, the unique gauge-invariant measure $\mathcal Q=|\hspace{-0.18em}| {\cdot}{\cdot}{\cdot} |\hspace{-0.18em}|^2$; independently of the field $\mathbb R$ or $\mathbb C$.

math.GM

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. Liu proposed the conjecture \[ \sum_{\text{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \ge 2+\left(\frac{2r}{R}\right)^k,\qquad k>1, \] with the reverse inequality for $k<1$. We prove this conjecture by reducing it to an algebraic inequality for three positive variables with prescribed sum and product. We also determine the equality cases.

math.GM