K*N subgroups: Difference between revisions

From Xenharmonic Wiki
Jump to navigation Jump to search
Wikispaces>genewardsmith
**Imported revision 232650890 - Original comment: **
m Recategorize
 
(8 intermediate revisions by 6 users not shown)
Line 1: Line 1:
<h2>IMPORTED REVISION FROM WIKISPACES</h2>
{{todo|explain its xenharmonic value}}
This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>
For any [[Harmonic_limit|prime limit]] ''p'', EDO ''N'', and positive integer ''k'', the ''p''-limit ''k''*''N'' subgroup is the largest [[just intonation subgroup]] of the ''p''-limit on which ''N''-edo and ''k''*''N''-edo approximate intervals to the same values using the mapping supplied by the [[patent val]] for ''k''*''N''-edo. This also means they temper out the same commas.  
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2011-05-28 23:35:02 UTC</tt>.<br>
: The original revision id was <tt>232650890</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>
<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">For any [[Harmonic limit|prime limit]] p, EDO N and positive integer k, the p-limit k*N subgroup is the largest [[Just intonation subgroups|just intonation subgroup]] of the p-limit on which N-edo and k*N-edo approximate intervals to the same values using the mapping supplied by the [[patent val]] for k*N-edo. This also means they temper out the same commas.  


A procedure for finding the k*N subgroup which seems to suffice is to take the product m of the odd primes less than or equal to p, and then find the [[Euler genera|Euler genus]] Euler(m^i) for integers 1, 2, and so forth. Here Euler(d) for an odd integer d is the set of all divisors of d reduced to an octave, and including 2. For each such genus, select those intervals such that the k*N patent val maps the interval to a number divisible by k, and then find the corresponding [[Normal lists|normal interval list]]. When two successive values i and i+1 lead to the same normal list, add to that a basis for the commas of the k*N patent val, and return the normal interval list for that.
A procedure for finding the ''k''*''N'' subgroup which seems to suffice is to take the product ''m'' of the odd primes less than or equal to ''p'', and then find the [[Euler genus]] Eu(''m''<sup>''i''</sup>) for integers 1, 2, and so forth. Here Eu(''d'') for an odd integer ''d'' is the set of all divisors of ''d'' reduced to an octave, and including 2. For each such genus, select those intervals such that the ''k''*''N'' patent val maps the interval to a number divisible by ''k'', and then find the corresponding [[normal lists|normal interval list]]. When two successive values ''i'' and {{nowrap|''i'' + 1}} lead to the same normal list, add to that a basis for the commas of the ''k''*''N'' patent val, and return the normal interval list for that.


</pre></div>
For example, to find the 7-limit 2*6 subgroup we first find {{nowrap|''m'' {{=}} 3 × 5 × 7 {{=}} 105}}. The subgroup of Eu(105) consisting of those intervals mapped to an even number by {{vector|12 19 28 34}} is 2.5.7. The subgroup of Eu(105<sup>2</sup>) is 2.9.5.7, not the same. However, the subgroup of Eu(105<sup>3</sup>) is again 2.9.5.7. If to this we add 81/80, we still obtain 2.9.5.7. It is clear this is maximal, as 3 is mapped by 12et to an odd number (19), and the rest of the values are prime.
<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">&lt;html&gt;&lt;head&gt;&lt;title&gt;k*N subgroups&lt;/title&gt;&lt;/head&gt;&lt;body&gt;For any &lt;a class="wiki_link" href="/Harmonic%20limit"&gt;prime limit&lt;/a&gt; p, EDO N and positive integer k, the p-limit k*N subgroup is the largest &lt;a class="wiki_link" href="/Just%20intonation%20subgroups"&gt;just intonation subgroup&lt;/a&gt; of the p-limit on which N-edo and k*N-edo approximate intervals to the same values using the mapping supplied by the &lt;a class="wiki_link" href="/patent%20val"&gt;patent val&lt;/a&gt; for k*N-edo. This also means they temper out the same commas. &lt;br /&gt;
[[Category:Algorithms]]
&lt;br /&gt;
[[Category:Math]]
A procedure for finding the k*N subgroup which seems to suffice is to take the product m of the odd primes less than or equal to p, and then find the &lt;a class="wiki_link" href="/Euler%20genera"&gt;Euler genus&lt;/a&gt; Euler(m^i) for integers 1, 2, and so forth. Here Euler(d) for an odd integer d is the set of all divisors of d reduced to an octave, and including 2. For each such genus, select those intervals such that the k*N patent val maps the interval to a number divisible by k, and then find the corresponding &lt;a class="wiki_link" href="/Normal%20lists"&gt;normal interval list&lt;/a&gt;. When two successive values i and i+1 lead to the same normal list, add to that a basis for the commas of the k*N patent val, and return the normal interval list for that.&lt;/body&gt;&lt;/html&gt;</pre></div>
[[Category:Regular temperament theory]]

Latest revision as of 07:58, 31 March 2025

For any prime limit p, EDO N, and positive integer k, the p-limit k*N subgroup is the largest just intonation subgroup of the p-limit on which N-edo and k*N-edo approximate intervals to the same values using the mapping supplied by the patent val for k*N-edo. This also means they temper out the same commas.

A procedure for finding the k*N subgroup which seems to suffice is to take the product m of the odd primes less than or equal to p, and then find the Euler genus Eu(mi) for integers 1, 2, and so forth. Here Eu(d) for an odd integer d is the set of all divisors of d reduced to an octave, and including 2. For each such genus, select those intervals such that the k*N patent val maps the interval to a number divisible by k, and then find the corresponding normal interval list. When two successive values i and i + 1 lead to the same normal list, add to that a basis for the commas of the k*N patent val, and return the normal interval list for that.

For example, to find the 7-limit 2*6 subgroup we first find m = 3 × 5 × 7 = 105. The subgroup of Eu(105) consisting of those intervals mapped to an even number by [12 19 28 34 is 2.5.7. The subgroup of Eu(1052) is 2.9.5.7, not the same. However, the subgroup of Eu(1053) is again 2.9.5.7. If to this we add 81/80, we still obtain 2.9.5.7. It is clear this is maximal, as 3 is mapped by 12et to an odd number (19), and the rest of the values are prime.