Graph-theoretic properties of scales

IMPORTED REVISION FROM WIKISPACES

This is an imported revision from Wikispaces. The revision metadata is included below for reference:

This revision was by author genewardsmith and made on 2012-08-17 23:50:07 UTC.

The original revision id was 358446885.

The revision comment was:

The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.

Original Wikitext content:

[[toc|flat]]

=Graph of a scale=
Given a [[periodic scale]], meaning a scale whose steps repeat, and assuming some multiple of the period is an interval of equivalence (usually this means the octave, ie interval of 2, which from now on we will assume is the interval of equivalence) then we may reduce the scale to a finite set S of pitch classes. This relates to the usual way of defining a scale, as used for instance by [[Scala]]. If we say 1-9/8-5/4-4/3-3/2-5/3-15/8-2 is a scale, we mean that each step of it represents a class of octave-equivalent pitches, so that "5/4" represents {...5/8, 5/4, 5/2, 5, 10 ...} and both "1" and "2" mean {...1/4, 1/2, 1, 2, 4...}. Suppose we have a finite set of pitches C strictly within the octave, so that s∊C entails 1 < s < 2, and suppose if s∊C then also 2/s∊C. The elements of C represent consonant pitch classes exclusive of the unison-octave class. 

We now may define the **graph of the scale**, which more precisely is the graph G = G(S, C) of the scale S together with the consonance set C. This means G is a (simple) [[http://en.wikipedia.org/wiki/Graph_(mathematics)|graph]] in the sense of [[http://en.wikipedia.org/wiki/Graph_theory|graph theory]]. The vertices of G, V(G), is the set S of pitch classes, and an edge is drawn between two distinct pitch classes r and s if X⋂C ≠ ∅, where X = {x/y|x∊r, y∊s}. This means that there is a relation of consonance, as defined by C, between the pitch classes r and s. It should be noted that we have defined things assuming pitches are given multiplicatively, but we can equally well express them in logarithmic terms as for instance by cents or by steps of an [[EDO]].

=Connectivity=
We can attribute various properties to a scale, given a choice of consonance set, by the presence of a graph-theoretic property in the graph of the scale. One key graph-theoretic property is connectivity. A graph is said to be //connected// if for any two vertices a and b, there is a path of edges between a and b. A scale is therefore connected if you can go from any one note to any other note by means of consonant intervals only. The graph G has an edge-connectivity λ(G) if it is possible to disconnect the graph by removing λ(G) edges, but no smaller number of edges will do. Similarly, it has vertex-connectivity κ(G) if it is possible to disconnect the graph by removing κ(G) vertices(notes of the scale) but no smaller number will do. The graph is //k-edge-connected// if λ(G) ≥ k, and //k-vertex-connected// if κ(G) ≥ k; these definitions transfer immediately to scales, and a high degree of connectivity may often be desired in a scale.

A [[http://en.wikipedia.org/wiki/Clique_(graph_theory)|clique]] in a graph is a subgraph such that there is an edge connecting every vertex; that is, the subgraph is a complete graph. In music terms, a clique is a [[dyadic chord]]. Hence, counting cliques of various degrees (number of notes) is a relevant consideration when analyzing a scale.

=Characteristic polynomial=
The [http://en.wikipedia.org/wiki/Adjacency_matrix|adjacency matrix]] A of a graph is the square symmetric matrix with zeros on the diagonal, with 1 at the (i, j) place if the ith vertex is connected to the jth vertex, and 0 if it is not. The [[http://en.wikipedia.org/wiki/Characteristic_polynomial|characteristic polynomial]] of a graph is the characteristic polynomial det(xI = A) of its adjacency matrix, an is a property (graph invariant) of the graph alone, without consideration of how the vertices are numbered. The degree n-1 term is 0, the n-2 term is minus the number of edges of the graph and therefore dyads of the scale, and the n-3 term minus twice the number of triads (3-cliques) in the graph and therefore the scale.

Original HTML content:

<html><head><title>Graph-theoretic properties of scales</title></head><body><!-- ws:start:WikiTextTocRule:6:&lt;img id=&quot;wikitext@@toc@@flat&quot; class=&quot;WikiMedia WikiMediaTocFlat&quot; title=&quot;Table of Contents&quot; src=&quot;/site/embedthumbnail/toc/flat?w=100&amp;h=16&quot;/&gt; --><!-- ws:end:WikiTextTocRule:6 --><!-- ws:start:WikiTextTocRule:7: --><a href="#Graph of a scale">Graph of a scale</a><!-- ws:end:WikiTextTocRule:7 --><!-- ws:start:WikiTextTocRule:8: --> | <a href="#Connectivity">Connectivity</a><!-- ws:end:WikiTextTocRule:8 --><!-- ws:start:WikiTextTocRule:9: --> | <a href="#Characteristic polynomial">Characteristic polynomial</a><!-- ws:end:WikiTextTocRule:9 --><!-- ws:start:WikiTextTocRule:10: -->
<!-- ws:end:WikiTextTocRule:10 --><br />
<!-- ws:start:WikiTextHeadingRule:0:&lt;h1&gt; --><h1 id="toc0"><a name="Graph of a scale"></a><!-- ws:end:WikiTextHeadingRule:0 -->Graph of a scale</h1>
Given a <a class="wiki_link" href="/periodic%20scale">periodic scale</a>, meaning a scale whose steps repeat, and assuming some multiple of the period is an interval of equivalence (usually this means the octave, ie interval of 2, which from now on we will assume is the interval of equivalence) then we may reduce the scale to a finite set S of pitch classes. This relates to the usual way of defining a scale, as used for instance by <a class="wiki_link" href="/Scala">Scala</a>. If we say 1-9/8-5/4-4/3-3/2-5/3-15/8-2 is a scale, we mean that each step of it represents a class of octave-equivalent pitches, so that &quot;5/4&quot; represents {...5/8, 5/4, 5/2, 5, 10 ...} and both &quot;1&quot; and &quot;2&quot; mean {...1/4, 1/2, 1, 2, 4...}. Suppose we have a finite set of pitches C strictly within the octave, so that s∊C entails 1 &lt; s &lt; 2, and suppose if s∊C then also 2/s∊C. The elements of C represent consonant pitch classes exclusive of the unison-octave class. <br />
<br />
We now may define the <strong>graph of the scale</strong>, which more precisely is the graph G = G(S, C) of the scale S together with the consonance set C. This means G is a (simple) <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Graph_(mathematics)" rel="nofollow">graph</a> in the sense of <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Graph_theory" rel="nofollow">graph theory</a>. The vertices of G, V(G), is the set S of pitch classes, and an edge is drawn between two distinct pitch classes r and s if X⋂C ≠ ∅, where X = {x/y|x∊r, y∊s}. This means that there is a relation of consonance, as defined by C, between the pitch classes r and s. It should be noted that we have defined things assuming pitches are given multiplicatively, but we can equally well express them in logarithmic terms as for instance by cents or by steps of an <a class="wiki_link" href="/EDO">EDO</a>.<br />
<br />
<!-- ws:start:WikiTextHeadingRule:2:&lt;h1&gt; --><h1 id="toc1"><a name="Connectivity"></a><!-- ws:end:WikiTextHeadingRule:2 -->Connectivity</h1>
We can attribute various properties to a scale, given a choice of consonance set, by the presence of a graph-theoretic property in the graph of the scale. One key graph-theoretic property is connectivity. A graph is said to be <em>connected</em> if for any two vertices a and b, there is a path of edges between a and b. A scale is therefore connected if you can go from any one note to any other note by means of consonant intervals only. The graph G has an edge-connectivity λ(G) if it is possible to disconnect the graph by removing λ(G) edges, but no smaller number of edges will do. Similarly, it has vertex-connectivity κ(G) if it is possible to disconnect the graph by removing κ(G) vertices(notes of the scale) but no smaller number will do. The graph is <em>k-edge-connected</em> if λ(G) ≥ k, and <em>k-vertex-connected</em> if κ(G) ≥ k; these definitions transfer immediately to scales, and a high degree of connectivity may often be desired in a scale.<br />
<br />
A <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Clique_(graph_theory)" rel="nofollow">clique</a> in a graph is a subgraph such that there is an edge connecting every vertex; that is, the subgraph is a complete graph. In music terms, a clique is a <a class="wiki_link" href="/dyadic%20chord">dyadic chord</a>. Hence, counting cliques of various degrees (number of notes) is a relevant consideration when analyzing a scale.<br />
<br />
<!-- ws:start:WikiTextHeadingRule:4:&lt;h1&gt; --><h1 id="toc2"><a name="Characteristic polynomial"></a><!-- ws:end:WikiTextHeadingRule:4 -->Characteristic polynomial</h1>
The [<!-- ws:start:WikiTextUrlRule:28:http://en.wikipedia.org/wiki/Adjacency_matrix --><a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Adjacency_matrix" rel="nofollow">http://en.wikipedia.org/wiki/Adjacency_matrix</a><!-- ws:end:WikiTextUrlRule:28 -->|adjacency matrix]] A of a graph is the square symmetric matrix with zeros on the diagonal, with 1 at the (i, j) place if the ith vertex is connected to the jth vertex, and 0 if it is not. The <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Characteristic_polynomial" rel="nofollow">characteristic polynomial</a> of a graph is the characteristic polynomial det(xI = A) of its adjacency matrix, an is a property (graph invariant) of the graph alone, without consideration of how the vertices are numbered. The degree n-1 term is 0, the n-2 term is minus the number of edges of the graph and therefore dyads of the scale, and the n-3 term minus twice the number of triads (3-cliques) in the graph and therefore the scale.</body></html>