Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma

Benutzer


products/Sources/formale Sprachen/GAP/pkg/hap/tutorial/tutex/ (GAP Algebra Version 4.15.1^©) Datei vom 19.6.2025 mit Größe 3 kB

Quelle 11.24.txt

Sprache: Text

gap> K:=ContractibleGcomplex("SL(2,O-13)");;
gap> PK:=QuotientOfContractibleGcomplex(K,Group(-One(K!.group)));;
gap> for n in [0..2] do
> for k in [1..PK!.dimension(n)] do
> S:=SmallGroup(IdGroup(PK!.stabilizer( n, k )));
> Print( [n,k]," is periodic ",IsPeriodic(S),"\n ");
> od;od;
[ 0, 1 ] is periodic true
[ 0, 2 ] is periodic true
[ 0, 3 ] is periodic true
[ 0, 4 ] is periodic true
[ 0, 5 ] is periodic true
[ 0, 6 ] is periodic true
[ 0, 7 ] is periodic false
[ 0, 8 ] is periodic false
[ 1, 1 ] is periodic true
[ 1, 2 ] is periodic true
[ 1, 3 ] is periodic true
[ 1, 4 ] is periodic true
[ 1, 5 ] is periodic true
[ 1, 6 ] is periodic true
[ 1, 7 ] is periodic true
[ 1, 8 ] is periodic true
[ 1, 9 ] is periodic true
[ 1, 10 ] is periodic true
[ 1, 11 ] is periodic true
[ 1, 12 ] is periodic true
[ 1, 13 ] is periodic true
[ 2, 1 ] is periodic true
[ 2, 2 ] is periodic true
[ 2, 3 ] is periodic true
[ 2, 4 ] is periodic true
[ 2, 5 ] is periodic true
[ 2, 6 ] is periodic true
[ 2, 7 ] is periodic true
[ 2, 8 ] is periodic true
[ 2, 9 ] is periodic true
[ 2, 10 ] is periodic true
[ 2, 11 ] is periodic true

gap> R:=ResolutionPSL2QuadraticIntegers(-13,35);;
gap> for n in [0..34] do
> Print("H_",n," = ", Homology(TensorWithIntegers(R),n),"\n");
> od;
H_0 = [ 0 ]
H_1 = [ 2, 2, 0, 0, 0 ]
H_2 = [ 6, 12, 0, 0 ]
H_3 = [ 2, 6, 6 ]
H_4 = [ 2, 2, 2, 2 ]
H_5 = [ 2, 2, 2, 2, 2 ]
H_6 = [ 2, 2, 2, 2, 6, 6 ]
H_7 = [ 2, 2, 2, 2, 2, 6, 6 ]
H_8 = [ 2, 2, 2, 2, 2, 2, 2, 2 ]
H_9 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_10 = [ 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_11 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_12 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_13 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_14 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_15 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_16 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_17 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_18 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_19 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_20 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_21 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_22 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_23 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_24 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_25 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_26 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_27 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_28 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_29 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_30 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_31 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]
H_32 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_33 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2 ]
H_34 = [ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6 ]

¤ Dauer der Verarbeitung: 0.9 Sekunden (vorverarbeitet am 2026-07-01) ¤

Wurzel

Suchen

PVS Prover

Isabelle Prover

NIST Cobol Testsuite

Cephes Mathematical Library

Vienna Development Method

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.