Download as pdf or txt
Download as pdf or txt
You are on page 1of 1

Thoughts on Klumpenhouwer Networks and Perle-Lansky Cycles 203

Example 3.1 Example 3.2

The speciéc retrograde K-nets of Example 2.3 can be found on


the various P-cycles here explored by suitable combinations of
CURSOR and FLIP transformations.

3. harmonic trichords in the webern passage

We shall now articulate the Webern passage of Example 2.1


into a different family of four trichords. In Example 3.1, the visu-
ally vertical trichords represent the most obvious parsing of the
Webern passage into various three-note harmonies. Each trichord
includes an interval-6 dyad; accordingly, the trichords can all be
represented by mutually isographic K-nets. Example 3.2 illustrates kT6l of the other. Likewise, gamma and retgamma are each kT 6l of
the phenomenon. The eight K-nets of Example 3.2 have among the other.
them the six graphs of Example 3.3, labeled alpha, retalpha, and Alpha and beta are related by kIAl. (The T-numbers of alpha
so forth.11 and beta are complements mod 12; corresponding I-numbers of
Graph retalpha, of Example 3.3, is kT 6l of graph alpha. alpha and beta add to ten.) Retalpha and beta are related by kI4l.
(Retalpha has the same T-number(s) as alpha; each I-number of (The T-numbers of retalpha and beta are complements mod 12;
retalpha is the corresponding I-number of alpha, plus 6.) Like- corresponding I-numbers of retalpha and beta add to four.) We can
wise, alpha is kT 6l of retalpha. Likewise, beta and retbeta are each therefore assert the super-network transformational arrangement
of Example 3.4.
selves here to “inner automorphisms,” we would be unable to speak of our kT1 l-
The supernetwork of the example has a graph isomorphic to
isography, which invokes an “outer automorphism,” so that the recursive fea- the K-net graph of Example 3.5. (The graphs are isomorphic be-
tures of Examples 2.4 and 2.5 would not be available to us. cause the kTls and kIls behave, as a mathematical group, just like
11 As with Example 2.2 earlier, isography theory observes about four of the
the correspondingly labeled Ts and Is.) And the graph of Example
distinct K-nets in Example 3.2 only that they can be represented by the two 3.5 is isomorphic to graph alpha. (Alpha and Example 3.5 have
graphs beta and retbeta of Example 3.3. As noted earlier, isography theory—
unlike P-cycle theory—does not discriminate among the K-nets themselves, but
the same T-numbers; the I-numbers of Example 3.5 are the corre-
only inspects their graphs. Klumpenhouwer’s “inner automorphisms” (of note sponding I-numbers of alpha, plus 1; Example 3.5 is accordingly
10) can do better. Unlike kT1l, kT 6l can arise from an inner automorphism. kT1l of graph alpha.) Accordingly, the supernetwork of Example

This content downloaded from


146.245.216.16 on Tue, 28 Apr 2020 04:54:07 UTC
All use subject to https://about.jstor.org/terms

You might also like