Recoverability: Difference between revisions

Line 1:

<h2>IMPORTED REVISION FROM WIKISPACES</h2>

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>2015-02-07 12:58:38 UTC</tt>.<br>

: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2015-02-07 16:33:09 UTC</tt>.<br>

: The original revision id was <tt>~~540094842~~</tt>.<br>

: The original revision id was <tt>540112790</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>

Line 23:

=Complete searches for temperaments=

By a complete search for regular temperaments is meant a search which is guaranteed to find all temperaments meeting certain specified conditions. Recoverability conditions provide one approach to these. The first segment of W∨2 consists of C(n-1, r-1) zeros, and the second segment of C(n-1, r) integers identical to the initial, 2 containing, segment of W. By beginning with such a multivector of integer coefficients, wedging with J, and rounding, we obtain a multivector which is a candidate for a p-limit rank r wedgie, defining a regular temperament. It will not in general be a wedgie, but all recoverable wedgies can be obtained in this way. Hence all that remains to do, as discussed in [[The wedgie]], is to test if the multivector in question is actually a wedgie, and also if it passes any further conditions on complexity, error of badness we wish to place on our list of wedgies.</pre></div>

By a complete search for regular temperaments is meant a search which is guaranteed to find all temperaments meeting certain specified conditions. Recoverability conditions provide one approach to these. The first segment of W∨2 consists of C(n-1, r-1) zeros, and the second segment of C(n-1, r) integers identical to the initial, 2 containing, segment of W. By beginning with such a multivector of integer coefficients, wedging with J, and rounding, we obtain a multivector which is a candidate for a p-limit rank r wedgie, defining a regular temperament. It will not in general be a wedgie, but all recoverable wedgies can be obtained in this way. Hence all that remains to do, as discussed in [[The wedgie]], is to test if the multivector in question is actually a wedgie, and also if it passes any further conditions on complexity, error, or badness we wish to place on our list of wedgies.</pre></div>

<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>Recoverability</title></head><body><a href="#Definition">Definition</a> | <a href="#Segments">Segments</a> | <a href="#The recoverability norm">The recoverability norm</a> | <a href="#The rank one case">The rank one case</a> | <a href="#Complete searches for temperaments">Complete searches for temperaments</a>

Line 42:

<br />

<h1 id="toc4"><a name="Complete searches for temperaments"></a>Complete searches for temperaments</h1>

By a complete search for regular temperaments is meant a search which is guaranteed to find all temperaments meeting certain specified conditions. Recoverability conditions provide one approach to these. The first segment of W∨2 consists of C(n-1, r-1) zeros, and the second segment of C(n-1, r) integers identical to the initial, 2 containing, segment of W. By beginning with such a multivector of integer coefficients, wedging with J, and rounding, we obtain a multivector which is a candidate for a p-limit rank r wedgie, defining a regular temperament. It will not in general be a wedgie, but all recoverable wedgies can be obtained in this way. Hence all that remains to do, as discussed in <a class="wiki_link" href="/The%20wedgie">The wedgie</a>, is to test if the multivector in question is actually a wedgie, and also if it passes any further conditions on complexity, error of badness we wish to place on our list of wedgies.</body></html></pre></div>

By a complete search for regular temperaments is meant a search which is guaranteed to find all temperaments meeting certain specified conditions. Recoverability conditions provide one approach to these. The first segment of W∨2 consists of C(n-1, r-1) zeros, and the second segment of C(n-1, r) integers identical to the initial, 2 containing, segment of W. By beginning with such a multivector of integer coefficients, wedging with J, and rounding, we obtain a multivector which is a candidate for a p-limit rank r wedgie, defining a regular temperament. It will not in general be a wedgie, but all recoverable wedgies can be obtained in this way. Hence all that remains to do, as discussed in <a class="wiki_link" href="/The%20wedgie">The wedgie</a>, is to test if the multivector in question is actually a wedgie, and also if it passes any further conditions on complexity, error, or badness we wish to place on our list of wedgies.</body></html></pre></div>

@@ Line 1: / Line 1: @@
 <h2>IMPORTED REVISION FROM WIKISPACES</h2>
 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>2015-02-07 12:58:38 UTC</tt>.<br>
+: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2015-02-07 16:33:09 UTC</tt>.<br>
-: The original revision id was <tt>540094842</tt>.<br>
+: The original revision id was <tt>540112790</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>
@@ Line 23: / Line 23: @@
 =Complete searches for temperaments=
-By a complete search for regular temperaments is meant a search which is guaranteed to find all temperaments meeting certain specified conditions. Recoverability conditions provide one approach to these. The first segment of W∨2 consists of C(n-1, r-1) zeros, and the second segment of C(n-1, r) integers identical to the initial, 2 containing, segment of W. By beginning with such a multivector of integer coefficients, wedging with J, and rounding, we obtain a multivector which is a candidate for a p-limit rank r wedgie, defining a regular temperament. It will not in general be a wedgie, but all recoverable wedgies can be obtained in this way. Hence all that remains to do, as discussed in [[The wedgie]], is to test if the multivector in question is actually a wedgie, and also if it passes any further conditions on complexity, error of badness we wish to place on our list of wedgies.</pre></div>
+By a complete search for regular temperaments is meant a search which is guaranteed to find all temperaments meeting certain specified conditions. Recoverability conditions provide one approach to these. The first segment of W∨2 consists of C(n-1, r-1) zeros, and the second segment of C(n-1, r) integers identical to the initial, 2 containing, segment of W. By beginning with such a multivector of integer coefficients, wedging with J, and rounding, we obtain a multivector which is a candidate for a p-limit rank r wedgie, defining a regular temperament. It will not in general be a wedgie, but all recoverable wedgies can be obtained in this way. Hence all that remains to do, as discussed in [[The wedgie]], is to test if the multivector in question is actually a wedgie, and also if it passes any further conditions on complexity, error, or badness we wish to place on our list of wedgies.</pre></div>
 <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;Recoverability&lt;/title&gt;&lt;/head&gt;&lt;body&gt;&lt;!-- ws:start:WikiTextTocRule:10:&amp;lt;img id=&amp;quot;wikitext@@toc@@flat&amp;quot; class=&amp;quot;WikiMedia WikiMediaTocFlat&amp;quot; title=&amp;quot;Table of Contents&amp;quot; src=&amp;quot;/site/embedthumbnail/toc/flat?w=100&amp;amp;h=16&amp;quot;/&amp;gt; --&gt;&lt;!-- ws:end:WikiTextTocRule:10 --&gt;&lt;!-- ws:start:WikiTextTocRule:11: --&gt;&lt;a href="#Definition"&gt;Definition&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:11 --&gt;&lt;!-- ws:start:WikiTextTocRule:12: --&gt; | &lt;a href="#Segments"&gt;Segments&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:12 --&gt;&lt;!-- ws:start:WikiTextTocRule:13: --&gt; | &lt;a href="#The recoverability norm"&gt;The recoverability norm&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:13 --&gt;&lt;!-- ws:start:WikiTextTocRule:14: --&gt; | &lt;a href="#The rank one case"&gt;The rank one case&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:14 --&gt;&lt;!-- ws:start:WikiTextTocRule:15: --&gt; | &lt;a href="#Complete searches for temperaments"&gt;Complete searches for temperaments&lt;/a&gt;&lt;!-- ws:end:WikiTextTocRule:15 --&gt;&lt;!-- ws:start:WikiTextTocRule:16: --&gt;
@@ Line 42: / Line 42: @@
 &lt;br /&gt;
 &lt;!-- ws:start:WikiTextHeadingRule:8:&amp;lt;h1&amp;gt; --&gt;&lt;h1 id="toc4"&gt;&lt;a name="Complete searches for temperaments"&gt;&lt;/a&gt;&lt;!-- ws:end:WikiTextHeadingRule:8 --&gt;Complete searches for temperaments&lt;/h1&gt;
-By a complete search for regular temperaments is meant a search which is guaranteed to find all temperaments meeting certain specified conditions. Recoverability conditions provide one approach to these. The first segment of W∨2 consists of C(n-1, r-1) zeros, and the second segment of C(n-1, r) integers identical to the initial, 2 containing, segment of W. By beginning with such a multivector of integer coefficients, wedging with J, and rounding, we obtain a multivector which is a candidate for a p-limit rank r wedgie, defining a regular temperament. It will not in general be a wedgie, but all recoverable wedgies can be obtained in this way. Hence all that remains to do, as discussed in &lt;a class="wiki_link" href="/The%20wedgie"&gt;The wedgie&lt;/a&gt;, is to test if the multivector in question is actually a wedgie, and also if it passes any further conditions on complexity, error of badness we wish to place on our list of wedgies.&lt;/body&gt;&lt;/html&gt;</pre></div>
+By a complete search for regular temperaments is meant a search which is guaranteed to find all temperaments meeting certain specified conditions. Recoverability conditions provide one approach to these. The first segment of W∨2 consists of C(n-1, r-1) zeros, and the second segment of C(n-1, r) integers identical to the initial, 2 containing, segment of W. By beginning with such a multivector of integer coefficients, wedging with J, and rounding, we obtain a multivector which is a candidate for a p-limit rank r wedgie, defining a regular temperament. It will not in general be a wedgie, but all recoverable wedgies can be obtained in this way. Hence all that remains to do, as discussed in &lt;a class="wiki_link" href="/The%20wedgie"&gt;The wedgie&lt;/a&gt;, is to test if the multivector in question is actually a wedgie, and also if it passes any further conditions on complexity, error, or badness we wish to place on our list of wedgies.&lt;/body&gt;&lt;/html&gt;</pre></div>