Search arXivSearch

arXiv · 2605.25649

What if we decompose a simple tone? The Chinese remainder theorem and structured Levi graphs in music

Abstract

While motivated by structural problems in mathematical music theory, this article introduces a novel combinatorial framework that advances the classification of cyclic cubic bipartite graphs. We extend the classical study of Levi graphs by endowing their vertices with an internal algebraic anatomy -- specifically, treating them not as empty geometric nodes, but as defined subsets of a cyclic base space Z_n. This internal structure allows us to formalize and classify a highly restricted class of graph isomorphisms: those strictly induced by global affine bijections f(x) = ax+b (mod n) operating directly on the underlying base set. By applying this framework to generalized tone networks (Tonnetze) unrolled via the Chinese Remainder Theorem in composite dimensions -- specifically the classic 12-TET (3x4) and the decaphonic 10-TET (2x5) -- we reveal absolute geometric anchors for these spaces, namely the (9,4) and (6,5) systems respectively. We completely classify the topological orbits of these structured graphs, proving a fundamental architectural dichotomy: while the isomorphic landscape of 12-TET splits into an orientation-preserving family and an orientation-reversing chiral mirror (providing a rigorous foundation for musical Negative Harmony), the 10-TET space is unconditionally orientation-preserving. Finally, we demonstrate that these abstract combinatorial properties manifest as rigidly coherent, parallel auditory universes through explicit structural voice-leading maps and acoustic physical modeling synthesis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paweł Nurowski. 2026-05-25. What if we decompose a simple tone? The Chinese remainder theorem and structured Levi graphs in music. https://arxiv.org/abs/2605.25649

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO