Anforderungen  |   Konzepte  |   Entwurf  |   Entwicklung  |   Qualitätssicherung  |   Lebenszyklus  |   Steuerung
 
 
 
 


Quelle  aboutPoincareSeries.html   Sprache: HTML

 
 products/Sources/formale Sprachen/GAP/pkg/hap/www/SideLinks/About/aboutPoincareSeries.html


<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
<head>
  <meta http-equiv="content-type"
 content="text/html; charset=ISO-8859-1">
  <title>AboutHap</title>
</head>
<body
 style="color: rgb(0, 0, 153); background-color: rgb(204, 255, 255);"
 alink="#000066" link="#000066" vlink="#000066">
<br>
<table
 style="text-align: left; margin-left: auto; margin-right: auto; color: rgb(0, 0, 102);"
 border="0" cellpadding="20" cellspacing="10">
  <tbody>
    <tr align="center">
      <th style="vertical-align: top;">
      <table style="width: 100%; text-align: left;" cellpadding="2"
 cellspacing="2">
        <tbody>
          <tr>
            <td style="vertical-align: top;"><a
 href="aboutModPRings.html"><small style="color: rgb(0, 0, 102);">Previous</small></a><br>
            </td>
            <td
 style="text-align: center; vertical-align: top; color: rgb(0, 0, 102);"><big><span
 style="font-weight: bold;">About HAP: Poincare series for groups of
order 32<br>
            </span></big></td>
            <td style="text-align: right; vertical-align: top;"><a
 href="aboutTorAndExt.html"><small style="color: rgb(0, 0, 102);">next</small></a><br>
            </td>
          </tr>
        </tbody>
      </table>
      <big><span style="font-weight: bold;"></span></big><br>
      </th>
    </tr>
    <tr>
      <td
 style="vertical-align: top; background-color: rgb(255, 255, 255);">The
      <span style="font-style: italic;">Poincare series</span> for the
cohomology ring H<sup>*</sup>(G,Z<sub>p</sub>) is the infinite series <br>
      <br>
      <div style="text-align: center;">a<sub>0</sub> + a<sub>1</sub>x +
a<sub>2</sub>x<sup>2</sup> + a<sub>3</sub>x<sup>3</sup> + ...<br>
      </div>
      <br>
where a<sub>k  </sub>is by definition the dimension of the vector
space H<sup>k</sup>(G,Z<sub>p</sub>) . The <span
 style="font-style: italic;">Poincare series can be expressed as</span>
a rational
function P(x)/Q(x) where P(x) and Q(x) are polynomials of finite
degree. <br>
      <br>
The following commands compute Poincare series for all the groups of
order 32. They rely on an algorithm which seems highly unlikely to
produce
a wrong answer. However, <span style="font-weight: bold;">there is no
general proof that the algorithm
produces a series which is correct in arbitrarily high degree. </span>Proofs
have to be provided case by case. <br>
      </td>
    </tr>
    <tr>
      <td
 style="vertical-align: top; background-color: rgb(255, 255, 204);">gap>
for G in AllSmallGroups(32) do<br>
> Print("\n Small Group ",IdSmallGroup(G)," has Poincare series \n",<br>
> PoincareSeries(G),"\n");<br>
> od;<br>
      <br>
 Small Group [ 32, 1 ] has Poincare series<br>
(1)/(-x+1)<br>
      <br>
 Small Group [ 32, 2 ] has Poincare series<br>
(x^2+x+1)/(-x^5+x^4+2*x^3-2*x^2-x+1)<br>
      <br>
 Small Group [ 32, 3 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 4 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 5 ] has Poincare series<br>
(1)/(-x^4+2*x^3-2*x+1)<br>
      <br>
 Small Group [ 32, 6 ] has Poincare series<br>
(1)/(-x^4+2*x^3-2*x+1)<br>
      <br>
 Small Group [ 32, 7 ] has Poincare series<br>
(x^2-x+1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 8 ] has Poincare series<br>
(x^5+x^2+1)/(x^8-2*x^7+2*x^6-2*x^5+2*x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 9 ] has Poincare series<br>
(1)/(-x^4+2*x^3-2*x+1)<br>
      <br>
 Small Group [ 32, 10 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 11 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 12 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 13 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 14 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 15 ] has Poincare series<br>
(1)/(x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 16 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 17 ] has Poincare series<br>
(1)/(x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 18 ] has Poincare series<br>
(1)/(x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 19 ] has Poincare series<br>
(1)/(x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 20 ] has Poincare series<br>
(x^2+x+1)/(-x^3+x^2-x+1)<br>
      <br>
 Small Group [ 32, 21 ] has Poincare series<br>
(1)/(-x^3+3*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 22 ] has Poincare series<br>
(1)/(x^5-3*x^4+2*x^3+2*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 23 ] has Poincare series<br>
(1)/(-x^3+3*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 24 ] has Poincare series<br>
(1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 25 ] has Poincare series<br>
(1)/(-x^3+3*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 26 ] has Poincare series<br>
(x^2+x+1)/(x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 27 ] has Poincare series<br>
(1)/(x^5-3*x^4+2*x^3+2*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 28 ] has Poincare series<br>
(1)/(-x^3+3*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 29 ] has Poincare series<br>
(1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 30 ] has Poincare series<br>
(x^3+x+1)/(-x^6+2*x^5-x^4+x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 31 ] has Poincare series<br>
(1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 32 ] has Poincare series<br>
(x^4+x^3+x^2+x+1)/(x^6-2*x^5+3*x^4-4*x^3+3*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 33 ] has Poincare series<br>
(-x^4+x^3+1)/(-x^7+3*x^6-5*x^5+7*x^4-7*x^3+5*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 34 ] has Poincare series<br>
(1)/(-x^3+3*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 35 ] has Poincare series<br>
(x^2+x+1)/(x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 36 ] has Poincare series<br>
(1)/(-x^3+3*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 37 ] has Poincare series<br>
(1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 38 ] has Poincare series<br>
(x^2+x+1)/(x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 39 ] has Poincare series<br>
(1)/(-x^3+3*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 40 ] has Poincare series<br>
(1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 41 ] has Poincare series<br>
(x^2+x+1)/(x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 42 ] has Poincare series<br>
(x^2+x+1)/(x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 43 ] has Poincare series<br>
(1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 44 ] has Poincare series<br>
(x^6+x^5+x^2+x+1)/(x^8-2*x^7+2*x^6-2*x^5+2*x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 45 ] has Poincare series<br>
(1)/(x^4-4*x^3+6*x^2-4*x+1)<br>
      <br>
 Small Group [ 32, 46 ] has Poincare series<br>
(1)/(x^4-4*x^3+6*x^2-4*x+1)<br>
      <br>
 Small Group [ 32, 47 ] has Poincare series<br>
(x^2+x+1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 48 ] has Poincare series<br>
(x^2+x+1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 49 ] has Poincare series<br>
(x^2+x+1)/(-x^5+3*x^4-4*x^3+4*x^2-3*x+1)<br>
      <br>
 Small Group [ 32, 50 ] has Poincare series<br>
(x^6+2*x^5+3*x^4+3*x^3+3*x^2+2*x+1)/(x^8-2*x^7+2*x^6-2*x^5+<br>
2*x^4-2*x^3+2*x^2-2*x+1)<br>
      <br>
 Small Group [ 32, 51 ] has Poincare series<br>
(1)/(-x^5+5*x^4-10*x^3+10*x^2-5*x+1)<br>
gap> TimeToString(time);<br>
"80.006 sec."<br>
      </td>
    </tr>
    <tr>
      <td
 style="vertical-align: top; background-color: rgb(255, 255, 255);">Click
      <a href="aboutPoincareSeriesII.html">here</a> for Poincare series
for the groups of order 64.<br>
      <span style="font-weight: bold;"></span></td>
    </tr>
    <tr align="center">
      <td
 style="vertical-align: top; background-color: rgb(255, 255, 255);"><span
 style="font-weight: bold;">Proving correctness of a poincare series<br>
      </span>
      <div style="text-align: left;"><span style="font-weight: bold;"></span><br>
We list a few simply stated results which, in some cases, suffice to
prove that a computed Poincare series is correct. In these, p(G)
denotes the poincare series of  a finite p-group G. We write
p(H)<=p(G) if the i-th coefficient of  p(H) is less than or
equal to the i-the coefficient of p(G) for all i. <br>
      <br>
      <table
 style="margin-left: auto; margin-right: auto; width: 80%; text-align: left;"
 border="0" cellpadding="20" cellspacing="2">
        <tbody>
          <tr>
            <td
 style="vertical-align: top; background-color: rgb(204, 255, 255);"><big><span
 style="font-weight: bold;">Theorem 1</span></big> <br>
If N is a normal subgroup of G then p(G)<=p(N)p(G/N). <br>
In particular, if G=N×Q is a direct product then p(G)=p(N)p(Q).</td>
          </tr>
        </tbody>
      </table>
      <br>
This follows immediately from the <a href="aboutExtensions.html">twised
tensor product</a> construction of CTC Wall.<br>
      <br>
      <br>
      <table
 style="margin-left: auto; margin-right: auto; width: 80%; text-align: left;"
 border="0" cellpadding="20" cellspacing="2">
        <tbody>
          <tr>
            <td
 style="vertical-align: top; background-color: rgb(204, 255, 255);"><big><span
 style="font-weight: bold;">Theorem 2<br>
            </span></big>If G is a cyclic p-group then p(G)=1/(1-x)<br>
            </td>
          </tr>
        </tbody>
      </table>
      <br>
So, for example, these two theorems in conjunction with the following
GAP commands prove that the dihedral group G=SmallGroup(32,18) has
poincare series p(G)<=1/(1-x)<sup>2</sup> .<br>
      <span style="font-weight: bold;"></span></div>
      </td>
    </tr>
    <tr>
      <td
 style="vertical-align: top; background-color: rgb(255, 255, 204);">gap>
G:=SmallGroup(32,18);;<br>
gap> N:=NormalSubgroups(G)[5];;<br>
gap> IsCyclic(N);<br>
true<br>
gap> IsCyclic(G/N);<br>
true<br>
      </td>
    </tr>
    <tr>
      <td
 style="vertical-align: top; background-color: rgb(255, 255, 255);">To
prove the equality p(G)=1/(1-x)<sup>2</sup> we consider the two maximal
elementary abelian subgroups A, B in G and the induced homomorpisms H<sup>*</sup>(G,Z<sub>p</sub>)
→  H<sup>*</sup>(A,Z<sub>p</sub>) , H<sup>*</sup>(G,Z<sub>p</sub>)
→  H<sup>*</sup>(B,Z<sub>p</sub>). (Actually, because these
homomorphisms are not yet implemented in HAP we look at the dual
homology homomorphisms: in this case the <span
 style="font-style: italic;">n</span>th homology is isomorphic to the <span
 style="font-style: italic;">n</span>th cohomology.) </td>
    </tr>
    <tr>
      <td
 style="vertical-align: top; background-color: rgb(255, 255, 204);">gap>
S:=LatticeSubgroups(G);;<br>
gap> S:=ConjugacyClassesSubgroups(S);;<br>
gap> S:=List(S,x->ClassElementLattice(x,1));;<br>
gap> S:=Filtered(S,x->IsElementaryAbelian(x));;<br>
gap> List(S,x->Order(x));<br>
[ 1, 2, 2, 2, 4, 4 ]<br>
gap> A:=S[5];;<br>
gap> B:=S[6];;<br>
      <br>
gap> RG:=ResolutionFiniteGroup(G,4);;<br>
gap> RA:=ResolutionFiniteGroup(A,4);;<br>
gap> A2G:=GroupHomomorphismByFunction(A,G,x->x);;<br>
gap> RA2RG:=EquivariantChainMap(RA,RG,A2G);;<br>
gap> CA2CG:=TensorWithIntegersModP(RA2RG,2);;<br>
gap> f1:=Homology(CA2CG,1);<br>
[ f1, f2 ] -> [ f1, <identity ...> ]<br>
gap> f2:=Homology(CA2CG,2);<br>
[ f1, f2, f3 ] -> [ f1, f1*f2*f3, f1*f2*f3 ]<br>
      <br>
gap> RB:=ResolutionFiniteGroup(B,4);;<br>
gap> B2G:=GroupHomomorphismByFunction(B,G,x->x);;<br>
gap> RB2RG:=EquivariantChainMap(RB,RG,B2G);;<br>
gap> CB2CG:=TensorWithIntegersModP(RB2RG,2);;<br>
gap> g1:=Homology(CB2CG,1);<br>
[ f1, f2 ] -> [ f2, <identity ...> ]<br>
gap> g2:=Homology(CB2CG,2);<br>
[ f1, f2, f3 ] -> [ f2, f1*f2*f3, f1*f2*f3 ]<br>
      </td>
    </tr>
    <tr>
      <td
 style="vertical-align: top; background-color: rgb(255, 255, 255);">Using
      <br>
      <br>
      <table
 style="margin-left: auto; margin-right: auto; width: 80%; text-align: left;"
 border="0" cellpadding="20" cellspacing="2">
        <tbody>
          <tr>
            <td
 style="vertical-align: top; background-color: rgb(204, 255, 255);"><big><span
 style="font-weight: bold;">Theorem 3</span></big><br>
Let E be the elementary abelian group of order 2<sup>n</sup>. Then the
graded cohomology ring H<sup>*</sup>(E,Z<sub>2</sub>) is isomorphic to
the
free polynomial ring Z<sub>2</sub>[x<sub>1</sub>,x<sub>2</sub>, ... ,x<sub>n</sub>] 
in which each x<sub>i</sub> has degree 1.<br>
            </td>
          </tr>
        </tbody>
      </table>
      <br>
we have H<sup>*</sup>(A,Z<sub>p</sub>) = Z<sub>p</sub>[x,y] and H<sup>*</sup>(B,Z<sub>p</sub>)
= Z<sub>p</sub>[u,v] .  From the above HAP computations we can
deduce that the image of the induced  ring homomorphism <br>
      <br>
      <div style="text-align: center;">f+g: H<sup>*</sup>(G,Z<sub>p</sub>) 
→  H<sup>*</sup>(A,Z<sub>p</sub>)  + H<sup>*</sup>(B,Z<sub>p</sub>)
= Z<sub>p</sub>[x,y] + Z<sub>p</sub>[u,v]  =Z<sub>p</sub>[x,y,u,v]/<xu=0,xv=0,yu=0,yv=0]<br>
      <div style="text-align: left;"><br>
contains the polynomials x, u, xy+uv and their products such as:<br>
  <sup><br>
      </sup>
      <table style="width: 100%; text-align: left;" border="1"
 cellpadding="2" cellspacing="2">
        <tbody>
          <tr>
            <td style="vertical-align: top;">Degree<br>
            </td>
            <td style="vertical-align: top;">Number<br>
of<br>
Polynomials<br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
          </tr>
          <tr>
            <td style="vertical-align: top;">0<br>
            </td>
            <td style="vertical-align: top;">1<br>
            </td>
            <td style="vertical-align: top;">1<br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
          </tr>
          <tr>
            <td style="vertical-align: top;">1<br>
            </td>
            <td style="vertical-align: top;">2<br>
            </td>
            <td style="vertical-align: top;">x<br>
            </td>
            <td style="vertical-align: top;">u<br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
          </tr>
          <tr>
            <td style="vertical-align: top;">2<br>
            </td>
            <td style="vertical-align: top;">3<br>
            </td>
            <td style="vertical-align: top;">x<sup>2</sup></td>
            <td style="vertical-align: top;">u<sup>2</sup></td>
            <td style="vertical-align: top;">xy+uv</td>
            <td style="vertical-align: top;"><br>
            </td>
            <td style="vertical-align: top;"><br>
            </td>
          </tr>
          <tr>
            <td style="vertical-align: top;">3<br>
            </td>
            <td style="vertical-align: top;">4<br>
            </td>
            <td style="vertical-align: top;">x<sup>3</sup></td>
            <td style="vertical-align: top;">u<sup>3</sup></td>
            <td style="vertical-align: top;">x<sup>2</sup>y</td>
            <td style="vertical-align: top;">u<sup>2</sup>v</td>
            <td style="vertical-align: top;"><br>
            </td>
          </tr>
          <tr>
            <td style="vertical-align: top;">4<br>
            </td>
            <td style="vertical-align: top;">5<br>
            </td>
            <td style="vertical-align: top;">x<sup>4</sup></td>
            <td style="vertical-align: top;">u<sup>4</sup></td>
            <td style="vertical-align: top;">x<sup>3</sup>y</td>
            <td style="vertical-align: top;">u<sup>3</sup>v</td>
            <td style="vertical-align: top;">x<sup>2</sup>y<sup>2</sup>+u<sup>2</sup>v<sup>2</sup></td>
          </tr>
        </tbody>
      </table>
      <sup><br>
      </sup>Hence the poincare series for the dihedral group satisfies
p(G) >= 1+2x+3x<sup>2</sup>+4x<sup>3</sup>+5x<sup>4</sup>+... =
1/(1-x)<sup>2</sup>. This completes the proof that p(G) = 1/(1-x)<sup>2
      </sup>.<br>
      </div>
      </div>
      </td>
    </tr>
    <tr>
      <td style="vertical-align: top;">
      <table
 style="margin-left: auto; margin-right: auto; width: 100%; text-align: left;"
 border="0" cellpadding="2" cellspacing="2">
        <tbody>
          <tr>
            <td style="vertical-align: top;"><a
 style="color: rgb(0, 0, 102);" href="aboutModPRings.html">Previous
Page</a><br>
            </td>
            <td style="text-align: center; vertical-align: top;"><a
 href="aboutContents.html"><span style="color: rgb(0, 0, 102);">Contents</span></a><br>
            </td>
            <td style="text-align: right; vertical-align: top;"><a
 href="aboutTorAndExt.html"><span style="color: rgb(0, 0, 102);">Next
page</span><br>
            </a> </td>
          </tr>
        </tbody>
      </table>
      <a href="aboutTopology.html"><br>
      </a> </td>
    </tr>
  </tbody>
</table>
<br>
<br>
</body>
</html>

Messung V0.5
C=91 H=100 G=95

¤ Dauer der Verarbeitung: 0.1 Sekunden  (vorverarbeitet)  ¤

*© Formatika GbR, Deutschland






Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

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.






                                                                                                                                                                                                                                                                                                                                                                                                     


Neuigkeiten

     Aktuelles
     Motto des Tages

Software

     Produkte
     Quellcodebibliothek

Aktivitäten

     Artikel über Sicherheit
     Anleitung zur Aktivierung von SSL

Muße

     Gedichte
     Musik
     Bilder

Jenseits des Üblichen ....
    

Besucherstatistik

Besucherstatistik

Monitoring

Montastic status badge