A composer is moving three voices from a C major chord (C4, E4, G4) to an F major chord (F4, A4, C5). Using the graph-theoretic model, which criterion determines the optimal voice assignment?
AThe assignment that avoids parallel fifths and octaves between any pair of voices
BThe assignment that minimizes the total number of semitones traveled across all voices
CThe assignment that keeps each voice as close as possible to its original register
DThe assignment that places the root of the F chord in the lowest voice
In the graph-theoretic formulation, a voice leading between two chords is a perfect matching in a bipartite graph where edge weights represent semitone distances. The optimal voice leading is the matching that minimizes the sum of edge weights — total semitone distance. This formalizes 'smoothness' as a computable quantity. Constraints like avoiding parallel fifths (option A) can be added as infinite-weight penalties on certain matchings, but the core optimization criterion is minimal total motion. Register preservation (option C) is a secondary heuristic, not the primary objective.
Question 2 Multiple Choice
Why is the Hungarian algorithm preferable to brute-force search for voice-leading optimization in textures with many voices?
AThe Hungarian algorithm incorporates knowledge of common-practice harmonic syntax that brute force ignores
BBrute-force search grows factorially with the number of voices (n! matchings for n voices), while the Hungarian algorithm solves minimum-weight bipartite matching in polynomial time
CThe Hungarian algorithm produces subjectively smoother voice leading because it was designed by music theorists
DBrute force requires continuous pitch space while the Hungarian algorithm works with discrete semitones
For n voices, the number of possible matchings between two n-note chords is n! — 4 voices give 24 matchings (tractable), but 8 voices give 40,320 and 12 give nearly 500 million. The Hungarian algorithm solves the minimum-weight perfect matching on a bipartite graph in O(n³) time, making it efficient regardless of texture size. This is an import from combinatorial optimization into music theory: the algorithm has no musical knowledge built in, yet it finds the objectively smoothest voice leading as defined by the distance metric.
Question 3 True / False
In the graph-theoretic model, finding the optimal voice leading between two chords is equivalent to finding the minimum-weight perfect matching in a bipartite graph, where nodes are pitches and edge weights are semitone distances.
TTrue
FFalse
Answer: True
This is the core formalization. Each pitch in chord A forms one partition of the bipartite graph; each pitch in chord B forms the other. An edge connects every pitch in A to every pitch in B, weighted by the semitone distance between them. A voice leading assigns each voice in A to exactly one pitch in B — a perfect matching. The optimal voice leading minimizes total cost — minimum-weight perfect matching. This translation from musical intuition ('smooth motion') to a solved combinatorial problem is what makes the graph-theoretic approach computationally tractable.
Question 4 True / False
Tymoczko's voice-leading geometry (orbifold model) and the graph-theoretic optimization approach are incompatible frameworks that model different aspects of harmonic motion.
TTrue
FFalse
Answer: False
They are complementary descriptions of the same underlying structure. Tymoczko's geometric model places n-voice chords in a continuous orbifold; paths through this space correspond to voice leadings, and path length equals voice-leading distance. The graph-theoretic model is a discretized, computable version of the same picture: instead of a continuous space, it works with a finite set of pitches and finds optimal matchings algorithmically. The geometric model provides qualitative structural insight (why common-practice progressions form efficient paths); the graph model provides explicit optimal solutions.
Question 5 Short Answer
What does it mean to say that voice-leading graph theory 'formalizes an aesthetic judgment into a computable quantity,' and what can this reveal that intuitive voice-leading rules alone cannot?
Think about your answer, then reveal below.
Model answer: Traditional voice-leading rules (prefer stepwise motion, avoid parallels) are heuristics that approximate an underlying goal: minimizing the aggregate distance voices travel. The graph-theoretic formulation makes this goal explicit and computable. By finding the minimum-weight matching, it can identify voice assignments that are more efficient than the one a trained musician would intuitively choose — especially in complex textures where many voices are moving simultaneously and the optimal assignment is non-obvious. It can also rank all possible voice leadings by total distance, revealing the full efficiency landscape rather than just offering a single suggestion.
Formalizing an aesthetic judgment means translating 'smooth' into a mathematical quantity (total semitone distance) that can be minimized exactly. The value is not that the algorithm replaces musical judgment, but that it can find solutions the human would miss — particularly non-obvious voice crossings or register swaps that reduce total motion below what the conventional assignment achieves.