Hahn distance: Difference between revisions
Wikispaces>genewardsmith **Imported revision 357345316 - Original comment: ** |
Wikispaces>genewardsmith **Imported revision 357979194 - Original comment: ** |
||
| Line 1: | Line 1: | ||
<h2>IMPORTED REVISION FROM WIKISPACES</h2> | <h2>IMPORTED REVISION FROM WIKISPACES</h2> | ||
This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br> | This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br> | ||
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-08- | : This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-08-15 14:03:42 UTC</tt>.<br> | ||
: The original revision id was <tt> | : The original revision id was <tt>357979194</tt>.<br> | ||
: The revision comment was: <tt></tt><br> | : The revision comment was: <tt></tt><br> | ||
The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br> | The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br> | ||
<h4>Original Wikitext content:</h4> | <h4>Original Wikitext content:</h4> | ||
<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">In graph theory, the distance between two vertices a and b is defined as the minimum number of edges in a path connecting them, or in other words the minimum length of a connecting path. Given a set of just intervals, or more usually, of classes of octave-equivalent intervals, we can define a corresponding graph whose vertices are the intervals and which contain an edge between two intervals if the ratio between them is a consonance. Normally the unison is not counted as a consonance, and we therefore obtain in this way a graph with no loops which is very useful in various ways, such as in the study of scales. | <div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;white-space: pre-wrap ! important" class="old-revision-html">In [[http://en.wikipedia.org/wiki/Graph_(mathematics)|graph theory]], the [[http://en.wikipedia.org/wiki/Distance_(graph_theory)|distance]] between two vertices a and b is defined as the minimum number of edges in a path connecting them, or in other words the minimum length of a connecting path; if there is no path connection them, the distance is regarded as infinite. Given a set of just intervals, or more usually, of classes of octave-equivalent intervals, we can define a corresponding graph whose vertices are the intervals and which contain an edge between two intervals if the ratio between them is a consonance. Normally the unison is not counted as a consonance, and we therefore obtain in this way a graph with no loops which is very useful in various ways, such as in the study of scales. | ||
If we apply the above construction to the set of p-limit interval classes, using as consonances the q-odd-limit consonances, where q is an odd number q ≥ p which less than the next prime after p, the resulting graph could be called the Hahn graph, and distance on it is q-limit Hahn distance between two octave classes. | If we apply the above construction to the set of p-limit interval classes, using as consonances the q-odd-limit consonances, excluding the unison and octaves, where q is an odd number q ≥ p which less than the next prime after p, the resulting graph could be called the Hahn graph, and distance on it is q-limit Hahn distance between two octave classes. | ||
Up to the 7-limit, Hahn distance has a very nice formula give by | Up to the 7-limit, Hahn distance has a very nice formula give by | ||
| Line 42: | Line 42: | ||
This makes the 9.5.7.11.13 sublattice symmetrical, corresponded to even distance values from the origin, with the full lattice corresponding to all positive integer distances.</pre></div> | This makes the 9.5.7.11.13 sublattice symmetrical, corresponded to even distance values from the origin, with the full lattice corresponding to all positive integer distances.</pre></div> | ||
<h4>Original HTML content:</h4> | <h4>Original HTML content:</h4> | ||
<div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html"><html><head><title>Hahn distance</title></head><body>In graph theory, the distance between two vertices a and b is defined as the minimum number of edges in a path connecting them, or in other words the minimum length of a connecting path. Given a set of just intervals, or more usually, of classes of octave-equivalent intervals, we can define a corresponding graph whose vertices are the intervals and which contain an edge between two intervals if the ratio between them is a consonance. Normally the unison is not counted as a consonance, and we therefore obtain in this way a graph with no loops which is very useful in various ways, such as in the study of scales.<br /> | <div style="width:100%; max-height:400pt; overflow:auto; background-color:#f8f9fa; border: 1px solid #eaecf0; padding:0em"><pre style="margin:0px;border:none;background:none;word-wrap:break-word;width:200%;white-space: pre-wrap ! important" class="old-revision-html"><html><head><title>Hahn distance</title></head><body>In <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Graph_(mathematics)" rel="nofollow">graph theory</a>, the <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Distance_(graph_theory)" rel="nofollow">distance</a> between two vertices a and b is defined as the minimum number of edges in a path connecting them, or in other words the minimum length of a connecting path; if there is no path connection them, the distance is regarded as infinite. Given a set of just intervals, or more usually, of classes of octave-equivalent intervals, we can define a corresponding graph whose vertices are the intervals and which contain an edge between two intervals if the ratio between them is a consonance. Normally the unison is not counted as a consonance, and we therefore obtain in this way a graph with no loops which is very useful in various ways, such as in the study of scales.<br /> | ||
<br /> | <br /> | ||
If we apply the above construction to the set of p-limit interval classes, using as consonances the q-odd-limit consonances, where q is an odd number q ≥ p which less than the next prime after p, the resulting graph could be called the Hahn graph, and distance on it is q-limit Hahn distance between two octave classes.<br /> | If we apply the above construction to the set of p-limit interval classes, using as consonances the q-odd-limit consonances, excluding the unison and octaves, where q is an odd number q ≥ p which less than the next prime after p, the resulting graph could be called the Hahn graph, and distance on it is q-limit Hahn distance between two octave classes.<br /> | ||
<br /> | <br /> | ||
Up to the 7-limit, Hahn distance has a very nice formula give by<br /> | Up to the 7-limit, Hahn distance has a very nice formula give by<br /> | ||