<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ EfficientNormalSubgroups</code>( <var class="Arg">G</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">‣ EfficientNormalSubgroups</code>( <var class="Arg">G</var>, <var class="Arg">k</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a prime-power group <span class="SimpleMath">G</span> and, optionally, a positive integer <span class="SimpleMath">k</span>. The default is <span class="SimpleMath">k=4</span>. The function returns a list of normal subgroups <span class="SimpleMath">N</span> in <span class="SimpleMath">G</span> such that the Poincare series for <span class="SimpleMath">G</span> equals the Poincare series for the direct product <span class="SimpleMath">(N × (G/N))</span> up to degree <span class="SimpleMath">k</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ExpansionOfRationalFunction</code>( <var class="Arg">f</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a positive integer <span class="SimpleMath">n</span> and a rational function <span class="SimpleMath">f(x)=p(x)/q(x)</span> where the degree of the polynomial <span class="SimpleMath">p(x)</span> is less than that of <span class="SimpleMath">q(x)</span>. It returns a list <span class="SimpleMath">[a_0 , a_1 , a_2 , a_3 , ... ,a_n]</span> of the first <span class="SimpleMath">n+1</span> coefficients of the infinite expansion</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PoincareSeries</code>( <var class="Arg">G</var>, <var class="Arg">n</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">‣ PoincareSeries</code>( <var class="Arg">R</var>, <var class="Arg">n</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">‣ PoincareSeries</code>( <var class="Arg">L</var>, <var class="Arg">n</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">‣ PoincareSeries</code>( <var class="Arg">G</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a finite <span class="SimpleMath">p</span>-group <span class="SimpleMath">G</span> and a positive integer <span class="SimpleMath">n</span>. It returns a quotient of polynomials <span class="SimpleMath">f(x)=P(x)/Q(x)</span> whose coefficient of <span class="SimpleMath">x^k</span> equals the rank of the vector space <span class="SimpleMath">H_k(G,Z_p)</span> for all <span class="SimpleMath">k</span> in the range <span class="SimpleMath">k=1</span> to <span class="SimpleMath">k=n</span>. (The second input variable can be omitted, in which case the function tries to choose a "reasonable" value for <span class="SimpleMath">n</span>. For <span class="SimpleMath">2</span>-groups the function PoincareSeriesLHS(G) can be used to produce an <span class="SimpleMath">f(x)</span> that is correct in all degrees.)</p>
<p>In place of the group <span class="SimpleMath">G</span> the function can also input (at least <span class="SimpleMath">n</span> terms of) a minimal mod <span class="SimpleMath">p</span> resolution <span class="SimpleMath">R</span> for <span class="SimpleMath">G</span>.</p>
<p>Alternatively, the first input variable can be a list <span class="SimpleMath">L</span> of integers. In this case the coefficient of <span class="SimpleMath">x^k</span> in <span class="SimpleMath">f(x)</span> is equal to the <span class="SimpleMath">(k+1)</span>st term in the list.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PoincareSeriesPrimePart</code>( <var class="Arg">G</var>, <var class="Arg">p</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a finite group <span class="SimpleMath">G</span>, a prime <span class="SimpleMath">p</span>, and a positive integer <span class="SimpleMath">n</span>. It returns a quotient of polynomials <span class="SimpleMath">f(x)=P(x)/Q(x)</span> whose coefficient of <span class="SimpleMath">x^k</span> equals the rank of the vector space <span class="SimpleMath">H_k(G,Z_p)</span> for all <span class="SimpleMath">k</span> in the range <span class="SimpleMath">k=1</span> to <span class="SimpleMath">k=n</span>.</p>
<p>The efficiency of this function needs to be improved.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PoincareSeriesLHS</code></td><td class="tdright">( global variable )</td></tr></table></div>
<p>Inputs a finite <span class="SimpleMath">2</span>-group <span class="SimpleMath">G</span> and returns a quotient of polynomials <span class="SimpleMath">f(x)=P(x)/Q(x)</span> whose coefficient of <span class="SimpleMath">x^k</span> equals the rank of the vector space <span class="SimpleMath">H_k(G,Z_2)</span> for all <span class="SimpleMath">k</span>.</p>
<p>This function was written by <strong class="button">Paul Smith</strong>. It use the Singular system for commutative algebra.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ Prank</code>( <var class="Arg">G</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a <span class="SimpleMath">p</span>-group <span class="SimpleMath">G</span> and returns the rank of the largest elementary abelian subgroup.</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.