<h5>2.1-1 EquivariantChainMap</h5><divclassfunc><table classfunc="100"<><tdclass"> class"">RLHSSpectralSequence">">">><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ EquivariantChainMap</code>( <var class="Arg">R</var>, <var class="Arg">S</var>, <var class="Arg">f</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a free <span class="SimpleMath">ZG</span>-resolution <span class="SimpleMath">R</span> of <span class="SimpleMath">Z</span>, a free <span class="SimpleMath">ZQ</span>-resolution <span class="SimpleMath">S</span> of <span class="SimpleMath">Z</span>, and a group homomorphism <span class="SimpleMath">f: G → Q</span>. It returns the induced <span class="SimpleMath">f</span>-equivariant chain map <span class="SimpleMath">F: R → S</span>.</p>
<div class="func">java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
<>< <td"dright"&;function;/d<tr>/>
<p>Inputs a torsion free crystallographic group <span class="SimpleMath">G</span>, also known as a Bieberbach group, represented using <strong class="button">AffineCrystGroupOnRight</strong> as in the GAP package Cryst. It also optionally inputs a choice of vector <span class="SimpleMath">v</span> in the Euclidean space <span class="SimpleMath">R^n</span> on which <span class="SimpleMath">G</span> acts freely. The function returns <span class="SimpleMath">n+1</ =functable=f"width=0%>tr>
<p>This function was written by Bui Anh java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
<p><strong class="button">Examples:</strong> <span class="URL"><a href="../tutorial/chap1.html">1</a></span> , <span class="URLjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
>=""="<>/>
<h5>2.1-5 ResolutionFiniteGroup</h5>
<div class="func">table="func ="0%>< ""< ="> ModPCohomologyRing>( var class=Arg"R<var="td="">&;function&;)
<divclass"< class""width"0"><code="func>&27 ResolutionSubgroup/> var =Arg"R<varvar="Arg">H</> )</td<tdclasstdright>(nbsp )<tdtrtablediv
<>Inputs freeZG-resolution < class=SimpleMath>Z<span afinite span=SimpleMath≤<span free ZH-resolution of =SimpleMath>Z</span./pjava.lang.StringIndexOutOfBoundsException: Index 208 out of bounds for length 208
p< class=">Examples:< class="><ahref.////."1/a> , ">< href=.www/About.html"2/>/> , < classURLhrefwww/java.lang.StringIndexOutOfBoundsException: Range [295, 294) out of bounds for length 318
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ HomToIntegers</code>(java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ HomToIntegers</code>( <var class="Arg">R</var> )</td><td class="tdright">( function )</td></tr></table></div>
< class"< class"" ="10"
)"&;function )/>/>/>/iv>
<p>Inputs a chain complex <span class="SimpleMath">C</span> of free abelian groups and returns the cochain complex <span class="SimpleMath">Hom_ Z(C, Z)</span>.</p>
<p>Inputs a free <span class="SimpleMath">ZG</span>-resolution <span class="SimpleMath">R</span> in characteristic <span class="SimpleMath">0</span> and returns the cochain complex <span class="SimpleMath">Hom_ ZG(R, Z)</span>.</p>
<p>Inputs an equivariant chain map <span class="SimpleMath">F: R→ S</span> of resolutions and returns the induced cochain map <span class="SimpleMath
<p><strong class="button">Examples:</strong> <span class="URL"><a href="../tutorial/chap1.html">1</java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
< class="func width="0%><tr classtdleftcodeclass="&8HomToIntegralModule varclass"">R, var ="Arg<vartd="dright"> function )</td>/></></div
<p>Inputs a free <span class="SimpleMath">ZGjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
<p>Inputs an equivariant chain map <span class="SimpleMath">F: R → S</span> in characteristic <span class="SimpleMath">0</span> and returns the div=">table = ="0>>< classcode=""&27 />< =ArgL<> <var""n/>)td"">&;function/>/><table</div
<p><strong class="button">Examples:</strong> <span class="URL"><a href="../tutorial/chap1.html">1</a></span> , <span class="URL"><a href="."n/>. returnsa ofpolynomials < classSimpleMath>(=x/Q()span expansion has coefficient of <span class=SimpleMath>^/>equalthe vector space< =SimpleMath>(,F_p> spanclass""><> range< classSimpleMath ≤ ≤n<span.( secondinput , trieschoose' . - thefunction classbuttonP()/> be used an< =SimpleMath>()"G/> can input a < =">nspanterms)a minimal< =""><s> =>/>for ="SimpleMath"></span Alternatively variable =>> integersIn case coefficient <span="^><span equaljava.lang.StringIndexOutOfBoundsException: Index 1363 out of bounds for length 1363
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ TensorWithIntegersModP</code>( <var class="Arg">C</var>, <var class="Arg">p</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">‣ TensorWithIntegersModP</code>( <var class="Arg">R</var>, <var class="Arg">p</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">‣ TensorWithIntegersModP</code>( <var class="Arg">F</var>, <var class="Arg">p</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a chain complex <span class="SimpleMath">C</span> of characteristic <span class="SimpleMath">0</span> and a prime integer <span class="SimpleMath">p</span>. It returns the chain complex <span class="SimpleMath">C ⊗_ Z Z_p</span> of characteristic <span class="SimpleMath">p</span>.</p>
<p>Inputs a free <span class="SimpleMath">ZG</span>-resolution <span class="SimpleMath">R</span> of characteristic <span class="SimpleMath">0</span> and a prime integer <span class="SimpleMath">p</span>. It returns the chain complex <span class="SimpleMath">R ⊗_ ZG Z_p</span> of characteristic <span class="SimpleMath">p</span>.</p>
<p>Inputs an equivariant chain map <span class="SimpleMath">F: R → S</span> in characteristic <span class="SimpleMath">0</span> a prime integer <span class="SimpleMath">p</span>. It returns the induced chain map <span class="SimpleMath">F⊗_ ZG Z_p : R ⊗_ ZG Z_p ⟶ S ⊗_ ZG Z_p</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AreIsomorphicGradedAlgebras</code>( <var class="Arg">A</var>, <var class="Arg">B</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs two freely presented graded algebras <span class="SimpleMath">A= F[x_1, ..., x_m]/I</span> and <span class="SimpleMath">B= F[y_1, ..., y_n]/J</span> and returns <strong class="button">true</strong> if they are isomorphic, and <strong class="button">false</strong> otherwise. This function was implemented by Paul Smith.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ HAPDerivation</code>( <var class="Arg">R</var>, <var class="Arg">I</var>, <var class="Arg">L</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a polynomial ring <span class="SimpleMath">R= F[x_1,...,x_m]</span> over a field <span class="SimpleMath">F</span> together with a list <span class="SimpleMath">I</span> of generators for an ideal in <span class="SimpleMath">R</span> and a list <span class="SimpleMath">L=[y_1,...,y_m]⊂ R</span>. It returns the derivation <span class="SimpleMath">d: E → E</span> for <span class="SimpleMath">E=R/I</span> defined by <span class="SimpleMath">d(x_i)=y_i</span>. This function was written by Paul Smith. It uses the Singular commutative algebra package.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ HilbertPoincareSeries</code>( <var class="Arg">E</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a presentation <span class="SimpleMath">E= F[x_1,...,x_m]/I</span> of a graded algebra and returns its Hilbert–Poincaré series. This function was written by Paul Smith and uses the Singular commutative algebra package. It is essentially a wrapper for Singular's Hilbert–Poincaré series.
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ HomologyOfDerivation</code>( <var class="Arg">d</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a derivation <span class="SimpleMath">d: E → E</span> on a quotient <span class="SimpleMath">E=R/I</span> of a polynomial ring <span class="SimpleMath">R= F[x_1,...,x_m]</span> over a field <span class="SimpleMath">F</span>. It returns a list <span class="SimpleMath">[S,J,h]</span> where <span class="SimpleMath">S</span> is a polynomial ring and <span class="SimpleMath">J</span> is a list of generators for an ideal in <span class="SimpleMath">S</span> such that there is an isomorphism <span class="SimpleMath">α: S/J → ker d/ im~ d</span>. This isomorphism lifts to the ring homomorphism <span class="SimpleMath">h: S → ker d</span>. This function was written by Paul Smith. It uses the Singular commutative algebra package.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ IntegralCohomologyGenerators</code>( <var class="Arg">R</var>, <var class="Arg">n</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs at least <span class="SimpleMath">n+1</span> terms of a free <span class="SimpleMath">ZG</span>-resolution of <span class="SimpleMath">Z</span> and the integer <span class="SimpleMath">n ≥ 1</span>. It returns a minimal list of cohomology classes in <span class="SimpleMath">H^n(G, Z)</span> which, together with all cup products of lower degree classes, generate the group <span class="SimpleMath">H^n(G, Z)</span> . (Let <span class="SimpleMath">a_i</span> be the <span class="SimpleMath">i</span>-th canonical generator of the <span class="SimpleMath">d</span>-generator abelian group <span class="SimpleMath">H^n(G,Z)</span>. The cohomology class <span class="SimpleMath">n_1a_1 + ... +n_da_d</span> is represented by the integer vector <span class="SimpleMath">u=(n_1, ..., n_d)</span>. )</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LHSSpectralSequence</code>( <var class="Arg">G</var>, <var class="Arg">N</var>, <var class="Arg">r</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a finite <span class="SimpleMath">2</span>-group <span class="SimpleMath">G</span>, and normal subgroup <span class="SimpleMath">N</span> and an integer <span class="SimpleMath">r</span>. It returns a list of length <span class="SimpleMath">r</span> whose <span class="SimpleMath">i</span>-th term is a presentation for the <span class="SimpleMath">i</span>-th page of the Lyndon-Hochschild-Serre spectral sequence. This function was written by Paul Smith. It uses the Singular commutative algebra package.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ LHSSpectralSequenceLastSheet</code>( <var class="Arg">G</var>, <var class="Arg">N</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs a finite <span class="SimpleMath">2</span>-group <span class="SimpleMath">G</span> and normal subgroup <span class="SimpleMath">N</span>. It returns presentation for the <span class="SimpleMath">E_∞</span> page of the Lyndon-Hochschild-Serre spectral sequence. This function was written by Paul Smith. It uses the Singular commutative algebra package.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ModPCohomologyGenerators</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">‣ ModPCohomologyGenerators</code>( <var class="Arg">R</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs either a <span class="SimpleMath">p</span>-group <span class="SimpleMath">G</span> and positive integer <span class="SimpleMath">n</span>, or else <span class="SimpleMath">n+1</span> terms of a minimal <span class="SimpleMath">FG</span>-resolution <span class="SimpleMath">R</span> of the field <span class="SimpleMath">F</span> of <span class="SimpleMath">p</span> elements. It returns a pair whose first entry is a minimal list of homogeneous generators for the cohomology ring <span class="SimpleMath">A=H^∗(G, F)</span> modulo all elements in degree greater than <span class="SimpleMath">n</span>. The second entry of the pair is a function <strong class="button">deg</strong> which, when applied to a minimal generator, yields its degree. WARNING: the following rule must be applied when multiplying generators <span class="SimpleMath">x_i</span> together. Only products of the form <span class="SimpleMath">x_1*(x_2*(x_3*(x_4*...)))</span> with <span class="SimpleMath">deg(x_i) ≤ deg(x_i+1)</span> should be computed (since the <span class="SimpleMath">x_i</span> belong to a structure constant algebra with only a partially defined structure constants table).</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ ModPCohomologyRing</code>( <var class="Arg">R</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">‣ ModPCohomologyRing</code>( <var class="Arg">R</var>, <var class="Arg">level</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">‣ ModPCohomologyRing</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">‣ ModPCohomologyRing</code>( <var class="Arg">G</var>, <var class="Arg">n</var>, <var class="Arg">level</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs either a <span class="SimpleMath">p</span>-group <span class="SimpleMath">G</span> and positive integer <span class="SimpleMath">n</span>, or else <span class="SimpleMath">n</span> terms of a minimal <span class="SimpleMath">FG</span>-resolution <span class="SimpleMath">R</span> of the field <span class="SimpleMath">F</span> of <span class="SimpleMath">p</span> elements. It returns the cohomology ring <span class="SimpleMath">A=H^∗(G, F)</span> modulo all elements in degree greater than <span class="SimpleMath">n</span>. The ring is returned as a structure constant algebra <span class="SimpleMath">A</span>. The ring <span class="SimpleMath">A</span> is graded. It has a component <strong class="button">A!.degree(x)</strong> which is a function returning the degree of each (homogeneous) element <span class="SimpleMath">x</span> in <strong class="button">GeneratorsOfAlgebra(A)</strong>. An optional input variable <span class="SimpleMath">"level"</span> can be set to one of the strings <span class="SimpleMath">"medium"</span> or <span class="SimpleMath">"high"</span>. These settings determine parameters in the algorithm. The default setting is <span class="SimpleMath">"medium"</span>. When <span class="SimpleMath">"level"</span> is set to <span class="SimpleMath">"high"</span> the ring <span class="SimpleMath">A</span> is returned with a component <strong class="button">A!.niceBasis</strong>. This component is a pair <span class="SimpleMath">[Coeff,Bas]</span>. Here <span class="SimpleMath">Bas</span> is a list of integer lists; a "nice" basis for the vector space <span class="SimpleMath">A</span> can be constructed using the command <strong class="button">List(Bas,x->Product(List(x,i->Basis(A)[i]))</strong>. The coefficients of the canonical basis element <strong class="button">Basis(A)[i]</strong> are stored as <strong class="button">Coeff[i]</strong>. If the ring <span class="SimpleMath">A</span> is computed using the setting <span class="SimpleMath">"level"="medium"</span> then the component <strong class="button">A!.niceBasis</strong> can be added to <span class="SimpleMath">A</span> using the command <strong class="button">A:=ModPCohomologyRing_part_2(A)</strong>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ GroupCohomology</code>( <var class="Arg">G</var>, <var class="Arg">k</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">‣ GroupCohomology</code>( <varjava.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0
<p>Inputs a group <span class="SimpleMath"><div classfunctable="func ="0"
code class="">&82;>( varclass="Argvar class"rg>P>, ( function )
/tr>
/divjava.lang.StringIndexOutOfBoundsException: Index 277 out of bounds for length 277
<p>If a prime <span class="SimpleMath">p</span> is given as an optional third input variable then the function returns the list of abelian invariants of <span class="SimpleMath">H^k(G, Z_p)</span>. In this case each abelian invariant will be equal to <span class="SimpleMath">p</span> and the length of the list will be the dimension of the vector space <span class="SimpleMath">H^k(G, Z_p)</span>.</p>
<p><strong class="button">Examples:</strong> <span class="URL"><a href="../tutorial/chap7.html">1</a></span> , <span class=>a id =""><a<pjava.lang.StringIndexOutOfBoundsException: Index 62 out of bounds for length 62
">‣PrimePartDerivedFunctor/code( Arg"G/>, R, >k/var><td="tdright">&bsp </d>/></tablediv>
<p>Inputs a group <span class="SimpleMath">G</span>, an integer <span class="SimpleMath">k ≥ 0</span>, at least <span class="SimpleMath">k+1</span> terms of a free <span class="SimpleMath">ZP</span>-resolution
<p><strong class="button">Examples:</strong> <span class="URL"><a href="../tutorial/chap7.html">1</a></span> ,a=""name<<java.lang.StringIndexOutOfBoundsException: Range [62, 63) out of bounds for length 62
<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">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">‣ 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>
<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 expansion has coefficient of <span class="SimpleMath">x^k</span> equal to the rank of the vector space <span class="SimpleMath">H_k(G, F_p)</span> for all <span class="SimpleMath">k</span> in the range <span class="SimpleMath">1 ≤ k ≤ n</span>. (The second input variable can be omitted, in which case the function tries to choose a `reasonable' value for n. For 2-groups the function PoincareSeriesLHS(G) can be used to produce an f(x) that is correct in all degrees.) In place of the group G the function can also input (at least n terms of) a minimal mod-p resolution R for G. Alternatively, the first input variable can be a list L of integers. In this case the coefficient of x^k in f(x) is equal to the (k+1)st term in the list.
<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">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">‣ 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>
<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 expansion has coefficient of <span class="SimpleMath">x^k</span> equal to the rank of the vector space <span class="SimpleMath">H_k(G, F_p)</span> for all <span class="SimpleMath">k</span> in the range <span class="SimpleMath">1 ≤ k ≤ n</span>. (The second input variable can be omitted, in which case the function tries to choose a `reasonable' value for n. For 2-groups the function PoincareSeriesLHS(G) can be used to produce an f(x) that is correct in all degrees.) In place of the group G the function can also input (at least n terms of) a minimal mod-p resolution R for G. Alternatively, the first input variable can be a list L of integers. In this case the coefficient of x^k in f(x) is equal to the (k+1)st term in the list.
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RankHomologyPGroup</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 <span class="SimpleMath">p</span>-group <span class="SimpleMath">G</span>, a rational function <span class="SimpleMath">P</span> representing the Poincaré series of the mod-<span class="SimpleMath">p</span> cohomology of <span class="SimpleMath">G</span> and a positive integer <span class="SimpleMath">n</span>. It returns the minimum number of generators for the finite abelian <span class="SimpleMath">p</span>-group <span class="SimpleMath">H_n(G, Z)</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ GroupAlgebraAsFpGModule</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 returns the modular group algebra <span class="SimpleMath">F_pG</span> in the form of an <span class="SimpleMath">F_pG</span>-module.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RadicalSeries</code>( <var class="Arg">M</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">‣ RadicalSeries</code>( <var class="Arg">R</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Inputs an <span class="SimpleMath">F_pG</span>-module <span class="SimpleMath">M</span> and returns its radical series as a list of <span class="SimpleMath">F_pG</span>-modules.</p>
<p>Inputs a free <span class="SimpleMath">F_pG</span>-resolution R and returns the filtered chain complex <span class="SimpleMath">⋯ Rad_2( F_pG)R ≤ Rad_1( F_pG)R ≤ R</span>.</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.0.39Bemerkung:
¤
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 und die Messung sind noch experimentell.