Klumpenhouwer network

A Klumpenhouwer Network, named after its inventor, Canadian music theorist and former doctoral student of David Lewin's at Harvard, Henry Klumpenhouwer, is "any network that uses T and/or I operations (transposition or inversion) to interpret interrelations among pcs" (pitch class sets). According to George Perle, "a Klumpenhouwer network is a chord analyzed in terms of its dyadic sums and differences," and "this kind of analysis of triadic combinations was implicit in," his "concept of the cyclic set from the beginning", cyclic sets being those "sets whose alternate elements unfold complementary cycles of a single interval."

"Klumpenhouwer's idea, both simple and profound in its implications, is to allow inversional, as well as transpositional, relations into networks like those of Figure 1," showing an arrow down from B to F♯ labeled T₇, down from F♯ to A labeled T₃, and back up from A to B, labeled T₁₀ which allows it to be represented by Figure 2a, for example, labeled I₅, I₃, and T₂. In Figure 4 this is (b) I₇, I₅, T₂ and (c) I₅, I₃, T₂.

Lewin asserts the "recursive potential of K-network analysis"... "'in great generality: When a system modulates by an operation A, the transformation f ' = A f A -inverse plays the structural role in the modulated system that f played in the original system.'"

Given any network of pitch classes, and given any pc operation A, a second network may be derived from the first, and the relationship thereby derived network isomorphism "arises between networks using analogous configurations of nodes and arrows to interpret pcsets that are of the same set class." "isomorphism of graphs. Two graphs are isomorphic when they share the same structure of nodes-and-arrows, and when also the operations labeling corresponding arrows correspond under a particular sort of mapping f among T/I."

"To generate isomorphic graphs, the mapping f must be what is called an automorphism of the T/I system. Networks that have isomorphic graphs are called isographic."

"to be isographic, two networks must have these features:

1. They must have the same configuration of nodes and arrows.
2. There must be some isomorphism F that maps the transformation-system used to label the arrows of one network, into the transformation-system used to label the arrows of the other.
3. If the transformation X labels an arrow of the one network, then the transformation F(X) labels the corresponding arrow of the other."

"Two networks are positively isographic when they share the same configuration of nodes and arrows, when the T-numbers of corresponding arrows are equal, and when the I-numbers of corresponding arrows differ by some fixed number j mod 12." "We call networks that contain identical graphs 'strongly isographic'". "Let the family of transpositions and inversions on pitch classes be called 'the T/I group.'"

"Any network can be retrograded by reversing all arrows and adjusting the transformations accordingly."

Klumpenhouwer's [true] conjecture: "nodes (a) and (b), sharing the same configuration of arrows, will always be isographic if each T-number of Network (b) is the same as the corresponding T-number of Network (a), while each I-number of Network (b) is exactly j more than the corresponding I, number of Network (a), where j is some constant number modulo 12."

Five Rules for Isography of Klumpenhouwer Networks:

1. Klumpenhouwer Networks (a) and (b), sharing the same configuration of nodes and arrows, will be isographic under the circumstance that each T-number of Network (b) is the same as the corresponding T-number of Network (a), and each I-number of Network (b) is exactly j more than the corresponding I-number of Network (a). The pertinent automorphism of the T/I group is F(1,j): F(1,j)(T_n)=T_n; F(1,j)(I_n) = I_n+J.
2. Klumpenhouwer Networks (a) and (b), will be isographic under the circumstance that each T-number of Network (b) is the complement of the corresponding T-number in Network (a), and each I-number of Network (b) is exactly j more than the complement of the corresponding I-number in Network (a)...F(11,j): F(11,j)(T_n)=T_−n; F(11,j)(I_n)=I_−n+j."
3. Klumpenhouwer Networks (a) and (b), will be isographic under the circumstance each T-number of Network (b) is 5 times the corresponding T-number in Network (a), and each I-number of Network (b) is exactly j more than 5 times the corresponding I-number in Network (a)...F(5,j): F(5,j)(T_n)=T_n; F(5,j)(I_n)=I_n+j.
4. Klumpenhouwer Networks (a) and (b), will be isographic under the circumstance each T-number of Network (b) is 7 times the corresponding T-number in Network (a), and each I-number of Network (b) is exactly j more than 7 times the corresponding I-number in Network (a)...F(7,j): F(7,j)(T_n)=T_n; F(7,j)(I_n)=I_n+j.
5. "Klumpenhouwer Networks (a) and (b), even if sharing the same configuration of nodes and arrows, will not be isographic under any other circumstances."

"Any one of Klupmenhouwer's triadic networks may thus be understood as a segment of cyclic set, and the interpretations of these and of the 'networks of networks'...efficiently and economically represented in this way."

If the graphs of chords are isomorphic by way of the appropriate F(u,j) operations, then they may be graphed as their own network.

Other terms include Lewin Transformational Network and strongly isomorphic.