Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1603.08904

Mathematical Harmony Analysis

David Ryan
View original source ↗Read source document ↗Export metadata ↓

Abstract

Musical chords, harmonies or melodies in Just Intonation have note frequencies which are described by a base frequency multiplied by rational numbers. For any local section, these notes can be converted to some base frequency multiplied by whole positive numbers. The structure of the chord can be analysed mathematically by finding functions which are unchanged upon chord transposition. These functions are are denoted invariant, and are important for understanding the structure of harmony. Each chord described by whole numbers has a greatest common divisor, GCD, and a lowest common multiple, LCM. The ratio of these is denoted Complexity which is a positive whole number. The set of divisors of Complexity give a subset of a p limit tone lattice and have both a natural ordering and a multiplicative structure. The position and orientation of the original chord, on the ordered set or on the lattice, give rise to many other invariant functions including measures for otonality and utonality. Other invariant functions can be constructed from: ratios between note pairs, prime projections, weighted chords which incorporate loudness. Given a set of conditions described by invariant functions, algorithms can be developed to find all scales or chords meeting those conditions, allowing the classification of consonant harmonies up to specified limits.

Explore related subjects

cs.SD

Keep this discovery

BibTeXRIS

David Ryan. 2016-03-29. Mathematical Harmony Analysis. https://arxiv.org/abs/1603.08904

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

KEEP EXPLORING

Related papers

arXiv2026

Xiaomi-CocktailASR-1 Technical Report

Recently, large language model (LLM) based ASR models have achieved significant progress, yet they generally lack support for multi-speaker scenarios, where the cocktail party problem remains a critical bottleneck for further advancing ASR. Existing TS-ASR methods, including end-to-end architectures with speaker embeddings and latest LLM-based explorations suffer from degraded single-speaker performance and the inability to reject when the target speaker is absent. In this paper, we propose Xiaomi-CocktailASR-1, an LLM-based end-to-end TS-ASR architecture. By utilizing reference speech as voiceprint prompts, it directly transcribes the target speaker's speech without requiring speech separation. Xiaomi-CocktailASR-1 maintains competitive performance in single-speaker scenarios, comparable to mainstream ASR models. It also features a negative sample rejection capability, outputting empty text when the target speaker is absent from the mixed speech. Additionally, Xiaomi-CocktailASR-1 supports a Chain-of-Thought (CoT) reasoning mode to provide explicit reasoning steps. Extensive experiments on various synthetic and real-world multispeaker benchmarks demonstrate that Xiaomi-CocktailASR-1 achieves state-of-the-art performance, effectively addressing the cocktail party problem through a unified architecture that balances multispeaker and single-speaker recognition accuracy, along with rejection capability.

cs.SD↗
arXiv2026

EConv-TasNet: Efficient Conv-TasNet for Effective Speech Separation

Conv-TasNet has served as a strong baseline for time-domain speech separation, and many studies have extended it with advanced architectures such as dual-path networks, U-Nets, and attention mechanisms. However, these methods often introduce high computational cost and complexity, limiting their deployment in resource-constrained scenarios. To address this issue, we propose eConv-TasNet, an efficient variant of Conv-TasNet that improves both effectiveness and efficiency without relying on resource-intensive modules. The proposed model consists of a group-wise early-splitting (GES) module and a multi-group feature aggregation (MGFA) module. GES generates discriminative speaker embeddings at intermediate stages, while MGFA progressively aggregates these group-level representations for refined mask estimation. Experimental results show that eConv-TasNet reduces model size by 22.4%, accelerates inference by 18.9%, and improves SI-SNRi by 14.0%-28.0% across three public benchmarks. Moreover, it achieves competitive performance compared with state-of-the-art methods while requiring significantly fewer parameters and lower inference cost. These results demonstrate a favorable efficiency-effectiveness trade-off for edge deployment.

cs.SD↗