Abc, high quality commas, and epimericity: Difference between revisions

Wikispaces>genewardsmith
**Imported revision 362961204 - Original comment: **
Wikispaces>genewardsmith
**Imported revision 363020322 - 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-09-07 20:05:02 UTC</tt>.<br>
: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-09-08 10:43:20 UTC</tt>.<br>
: The original revision id was <tt>362961204</tt>.<br>
: The original revision id was <tt>363020322</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>
Line 16: Line 16:
=The DoReMi conjecture=
=The DoReMi conjecture=
Since not much musical meaning seems to attach to the commas dividing n-d, it makes sense for our purposes to modify the definition of quality. Let doremi(n/d) = log(n)/log((n-d)radical(nd)), where radical(nd) is the product of the primes dividing nd. Then q(n/d) ≤ doremi(n/d), so that the condition that doremi(n/d) &gt; 1+ϵ is stronger than q(n/d) &gt; 1+ϵ, and there will be fewer intervals which qualify. This means that if the list of q(n/d) &gt; 1+ϵ is finite, so is the list of doremi(n/d) &gt; 1+ϵ, and so ABC implies DoReMi but not conversely; DoReMi is a slightly weaker conjecture, but (according to Noam Elkies) still unproven also. Aside from making more musical sense, doremi has the further advantage of being enormously easier to compute if n/d is in some small p-limit, as then the computation of radical(nd) involves only small primes. A comma n/d with doremi(n/d) &gt; 1 we may call a doremi comma.
Since not much musical meaning seems to attach to the commas dividing n-d, it makes sense for our purposes to modify the definition of quality. Let doremi(n/d) = log(n)/log((n-d)radical(nd)), where radical(nd) is the product of the primes dividing nd. Then q(n/d) ≤ doremi(n/d), so that the condition that doremi(n/d) &gt; 1+ϵ is stronger than q(n/d) &gt; 1+ϵ, and there will be fewer intervals which qualify. This means that if the list of q(n/d) &gt; 1+ϵ is finite, so is the list of doremi(n/d) &gt; 1+ϵ, and so ABC implies DoReMi but not conversely; DoReMi is a slightly weaker conjecture, but (according to Noam Elkies) still unproven also. Aside from making more musical sense, doremi has the further advantage of being enormously easier to compute if n/d is in some small p-limit, as then the computation of radical(nd) involves only small primes. A comma n/d with doremi(n/d) &gt; 1 we may call a doremi comma.
The DoReMi commas with numerator less than 1000 are 32/27, 9/8, 256/243, 250/243, 128/125, 49/48, 64/63, 81/80, 512/507, 245/243, 225/224, 243/242, 289/288, 513/512, 625/624, 676/675, 729/728 and 961/960. Note that large powers of small commas are favored, so that commas such as 512/507 are on the list.


=Links=  
=Links=  
Line 32: Line 34:
&lt;!-- ws:start:WikiTextHeadingRule:4:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc2"&gt;&lt;a name="The DoReMi conjecture"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:4 --&gt;The DoReMi conjecture&lt;/h1&gt;
&lt;!-- ws:start:WikiTextHeadingRule:4:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc2"&gt;&lt;a name="The DoReMi conjecture"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:4 --&gt;The DoReMi conjecture&lt;/h1&gt;
Since not much musical meaning seems to attach to the commas dividing n-d, it makes sense for our purposes to modify the definition of quality. Let doremi(n/d) = log(n)/log((n-d)radical(nd)), where radical(nd) is the product of the primes dividing nd. Then q(n/d) ≤ doremi(n/d), so that the condition that doremi(n/d) &amp;gt; 1+ϵ is stronger than q(n/d) &amp;gt; 1+ϵ, and there will be fewer intervals which qualify. This means that if the list of q(n/d) &amp;gt; 1+ϵ is finite, so is the list of doremi(n/d) &amp;gt; 1+ϵ, and so ABC implies DoReMi but not conversely; DoReMi is a slightly weaker conjecture, but (according to Noam Elkies) still unproven also. Aside from making more musical sense, doremi has the further advantage of being enormously easier to compute if n/d is in some small p-limit, as then the computation of radical(nd) involves only small primes. A comma n/d with doremi(n/d) &amp;gt; 1 we may call a doremi comma.&lt;br /&gt;
Since not much musical meaning seems to attach to the commas dividing n-d, it makes sense for our purposes to modify the definition of quality. Let doremi(n/d) = log(n)/log((n-d)radical(nd)), where radical(nd) is the product of the primes dividing nd. Then q(n/d) ≤ doremi(n/d), so that the condition that doremi(n/d) &amp;gt; 1+ϵ is stronger than q(n/d) &amp;gt; 1+ϵ, and there will be fewer intervals which qualify. This means that if the list of q(n/d) &amp;gt; 1+ϵ is finite, so is the list of doremi(n/d) &amp;gt; 1+ϵ, and so ABC implies DoReMi but not conversely; DoReMi is a slightly weaker conjecture, but (according to Noam Elkies) still unproven also. Aside from making more musical sense, doremi has the further advantage of being enormously easier to compute if n/d is in some small p-limit, as then the computation of radical(nd) involves only small primes. A comma n/d with doremi(n/d) &amp;gt; 1 we may call a doremi comma.&lt;br /&gt;
&lt;br /&gt;
The DoReMi commas with numerator less than 1000 are 32/27, 9/8, 256/243, 250/243, 128/125, 49/48, 64/63, 81/80, 512/507, 245/243, 225/224, 243/242, 289/288, 513/512, 625/624, 676/675, 729/728 and 961/960. Note that large powers of small commas are favored, so that commas such as 512/507 are on the list.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;!-- ws:start:WikiTextHeadingRule:6:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc3"&gt;&lt;a name="Links"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:6 --&gt;Links&lt;/h1&gt;
&lt;!-- ws:start:WikiTextHeadingRule:6:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc3"&gt;&lt;a name="Links"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:6 --&gt;Links&lt;/h1&gt;