Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.
Real-time collaboration for Jupyter Notebooks, Linux Terminals, LaTeX, VS Code, R IDE, and more,
all in one place.
| Download
GAP 4.8.9 installation with standard packages -- copy to your CoCalc project to get it
Project: cocalc-sagemath-dev-slelievre
Views: 418346G:=SymmetricGroup(4);; K:=QuillenComplex(G,2);; ##################################################################### ##################################################################### IsHapGChainComplex:=NewFilter("IsHapGChainComplex");; HapGChainComplex:=NewType(FamilyObj(rec()), IsHapGChainComplex and IsComponentObjectRep and IsHapComplex);; InstallMethod( ViewObj, "for HapGChainComplex", [IsHapGChainComplex], function(R) Print("G-chain complex in characteristic ", EvaluateProperty(R,"characteristic"), " for "); ViewObj(R!.group); Print(" . \n"); end); InstallMethod( PrintObj, "for HapGChainComplex", [IsHapGChainComplex], function(R) Print("G-chain complex of length ", EvaluateProperty(R,"length"), " in characteristic ", EvaluateProperty(R,"characteristic"), " for ", R!.group," . \n"); end); ##################################################################### ##################################################################### ###################################################### ###################################################### GChainComplex:=function(K,G) local Ksimps,R, orbits, stabilizers, stabfn, Dim, lessthan, boundfn, elts, i, k, x, m,Action ,ontuples; elts:=Elements(G); Ksimps:=[]; for k in [1..1+Dimension(K)] do Ksimps[k]:=List(K!.simplicesLst[k],x->StructuralCopy(x)); od; ############################# Action:=function(a,b,c) return 1; end; ############################# ############################# ontuples:=function(x,g) local g1; g1:=g^-1; return OnTuples(x,g1); end; ############################# lessthan:=function(a,b) return Order(a)<Order(b); end; for k in [1..Dimension(K)+1] do for x in Ksimps[k] do Sort(x,lessthan); od; od; orbits:=[]; for k in [1..1+Dimension(K)] do orbits[k]:=OrbitsDomain(G,Ksimps[k], ontuples); od; stabilizers:=[]; for k in [1..1+Dimension(K)] do stabilizers[k]:=[]; for i in [1..Length(orbits[k])] do stabilizers[k][i]:=Stabilizer(G,orbits[k][i][1],ontuples); od;od; ###################### Dim:=function(k); if k<0 or k>Dimension(K) then return 0; fi; return Length(orbits[k+1]); end; ###################### ###################### stabfn:=function(k,i); return stabilizers[k+1][i]; end; ###################### ###################### boundfn:=function(n,i) local V,Vhat, ii, j, m,bnd,g,ob; if n<=0 then return []; fi; V:=orbits[n+1][i][1]; V:=SSortedList(V); bnd:=[]; for j in [1..Length(V)] do Vhat:=StructuralCopy(V); RemoveSet(Vhat,V[j]); m:=K!.enumeratedSimplex(Vhat); m:=Ksimps[n][m]; for ii in [1..Length(orbits[n])] do if m in orbits[n][ii] then ob:=ii; break; fi; od; for g in [1..Length(elts)] do if ontuples(orbits[n][ob][1],elts[g])=m then break; fi; od; if IsOddInt(j) then Add(bnd,[ob,g]); else Add(bnd,[-ob,g]); fi; od; return bnd; end; ###################### R:=Objectify(HapGChainComplex, rec( dimension:=Dim, boundary:=boundfn, homotopy:=fail, elts:=Elements(G), group:=G, stabilizer:=stabfn, action:=Action, properties:= [["length",Dimension(K)], ["characteristic",0]])); return R; end; ###################################################### ###################################################### R:=GChainComplex(K,G);