<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AddFreeWords</code>( <var class="Arg">v</var>, <var class="Arg">w</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs two words <span class="SimpleMath">v,w</span> in a free <span class="SimpleMath">ZG</span>-module and returns their sum <span class="SimpleMath">v+w</span>. If the characteristic of <span class="SimpleMath">Z</span> is greater than <span class="SimpleMath">0</span> then the next function might be more efficient.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AddFreeWordsModP</code>( <var class="Arg">v</var>, <var class="Arg">w</var>, <var class="Arg">p</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs two words <span class="SimpleMath">v,w</span> in a free <span class="SimpleMath">ZG</span>-module and the characteristic <span class="SimpleMath">p</span> of <span class="SimpleMath">Z</span>. It returns the sum <span class="SimpleMath">v+w</span>. If <span class="SimpleMath">p=0</span> the previous function might be fractionally quicker.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AlgebraicReduction</code>( <var class="Arg">w</var> )</td><td class="tdright">( function )</td></tr></table></div>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AlgebraicReduction</code>( <var class="Arg">w</var>, <var class="Arg">p</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a word <span class="SimpleMath">w</span> in a free <span class="SimpleMath">ZG</span>-module and returns a reduced version of the word in which all pairs of mutually inverse letters have been cancelled. The reduction is performed in a free abelian group unless the characteristic <span class="SimpleMath">p</span> of <span class="SimpleMath">Z</span> is entered.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ NegateWord</code>( <var class="Arg">w</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a word <span class="SimpleMath">w</span> in a free <span class="SimpleMath">ZG</span>-module and returns the negated word <span class="SimpleMath">-w</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PrintZGword</code>( <var class="Arg">w</var>, <var class="Arg">elts</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a word <span class="SimpleMath">w</span> in a free <span class="SimpleMath">ZG</span>-module and a (possibly partial but sufficient) listing elts of the elements of <span class="SimpleMath">G</span>. The function prints the word <span class="SimpleMath">w</span> to the screen in the form</p>
<p>where <span class="SimpleMath">r_i</span> are elements in the group ring <span class="SimpleMath">ZG</span>, and <span class="SimpleMath">E_i</span> denotes the <span class="SimpleMath">i</span>-th free generator of the module.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ TietzeReduction</code>( <var class="Arg">S</var>, <var class="Arg">w</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a set <span class="SimpleMath">S</span> of words in a free <span class="SimpleMath">ZG</span>-module, and a word <span class="SimpleMath">w</span> in the module. The function returns a word <span class="SimpleMath">w' such that {S,w'</span>} generates the same abelian group as {<spanclass="SimpleMath">S,w</span>}. The word <span class="SimpleMath">w' is possibly shorter (and certainly no longer) than w. This function needs to be improved!
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ResolutionBoundaryOfWord</code>( <var class="Arg">R</var>, <var class="Arg">n</var>, <var class="Arg">w</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a resolution <span class="SimpleMath">R</span>, a positive integer <span class="SimpleMath">n</span> and a list <span class="SimpleMath">w</span> representing a word in the free module <span class="SimpleMath">R_n</span>. It returns the image of <span class="SimpleMath">w</span> under the <span class="SimpleMath">n</span>-th boundary homomorphism.</p>
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.