Home
last modified time | relevance | path

Searched refs:hasse (Results 1 – 25 of 104) sorted by relevance

12345

/dports/math/gap/gap-4.11.0/pkg/hapcryst-0.1.13/lib/
H A DFaceLatticeAndBoundaryBieberbachGroup.gi109 faces:=hasse[codim+1];
160 for faces in hasse
288 face:=hasse[k+1][j];
452 removeSomeFaces(List(hasse[codim],i->i[1]),hasse[codim+1]);
453 hasse[codim+1]:=Set(hasse[codim+1]);
455 hasse[codim+1]:=changeHasseEntries(faceOrbits,codim,vertices,hasse,group);
461 tmp:=hasse[codim];
462 hasse[codim]:=hasse[dim+2-codim];
470 hasse[k+1][j][2]:=calculateBoundary(k,j,hasse);
473 if fail in Flat(hasse)
[all …]
H A DresolutionBieberbach.gi64 boundary2, groupring, resolution, homotopy, hasse,
67 if k<0 or k>Size(fl.hasse)-1
71 return Size(fl.hasse[k+1]);
76 if k<0 or k>Size(resolution!.hasse)-1
80 return Size(resolution!.hasse[k+1]);
90 if k<=0 or k>=Size(fl.hasse)
94 word:=fl.hasse[k+1][AbsInt(j)][2];
141 if k<=0 or k>=Size(resolution!.hasse)
148 for term in resolution!.hasse[k+1][j][2]
179 hasse:=fl.hasse,
[all …]
/dports/lang/perl5.34/perl-5.34.0/lib/Net/
H A Dservent.t9 our $hasse;
11 $hasse = 1 unless $@ && $@ =~ /unimplemented|unsupported/i;
12 unless ($hasse) { print "1..0 # Skip: no getservbyname\n"; exit 0 }
14 $hasse = 0 unless $Config{'i_netdb'} eq 'define';
15 unless ($hasse) { print "1..0 # Skip: no netdb.h\n"; exit 0 }
/dports/lang/perl5.30/perl-5.30.3/lib/Net/
H A Dservent.t9 our $hasse;
11 $hasse = 1 unless $@ && $@ =~ /unimplemented|unsupported/i;
12 unless ($hasse) { print "1..0 # Skip: no getservbyname\n"; exit 0 }
14 $hasse = 0 unless $Config{'i_netdb'} eq 'define';
15 unless ($hasse) { print "1..0 # Skip: no netdb.h\n"; exit 0 }
/dports/lang/perl5.32/perl-5.32.1/lib/Net/
H A Dservent.t9 our $hasse;
11 $hasse = 1 unless $@ && $@ =~ /unimplemented|unsupported/i;
12 unless ($hasse) { print "1..0 # Skip: no getservbyname\n"; exit 0 }
14 $hasse = 0 unless $Config{'i_netdb'} eq 'define';
15 unless ($hasse) { print "1..0 # Skip: no netdb.h\n"; exit 0 }
/dports/lang/perl5-devel/perl5-5.35.4-102-ge43d289c7c/lib/Net/
H A Dservent.t9 our $hasse;
11 $hasse = 1 unless $@ && $@ =~ /unimplemented|unsupported/i;
12 unless ($hasse) { print "1..0 # Skip: no getservbyname\n"; exit 0 }
14 $hasse = 0 unless $Config{'i_netdb'} eq 'define';
15 unless ($hasse) { print "1..0 # Skip: no netdb.h\n"; exit 0 }
/dports/editors/texstudio/texstudio-4.1.2/completion/
H A Dlie-hasse.cwl1 # lie-hasse package
7 \hasse{%<letter%>}{%<rank%>}
8 \hasse[%<options%>]{%<letter%>}{%<rank%>}
10 #keyvals:\hasse#c
/dports/math/gap/gap-4.11.0/pkg/hapcryst-0.1.13/examples/
H A Dhasse_diagram_reformat.gi2 function(hasse)
10 faceblocks:=List(hasse.faceindices,i->List(i));
11 nodes:=List(hasse.hasse,face->[List(face[1]),List(face[2])]);
13 facenumber:=Size(hasse.hasse);
111 # returnrec:=rec(hasse:=nodes,
/dports/math/gap/gap-4.11.0/pkg/OpenMath-11.5.0/
H A Dinit.g129 ReadPackage("openmath", "/hasse/config.g");
130 ReadPackage("openmath", "/hasse/hasse.g");
/dports/math/coxeter3/coxeter-7b5a1f0/headers/
H A DGAPrcellorder4 ## <=_R on the group. What we output is the hasse diagram of this ordering
13 ## the (reversed) right cell ordering, in the sense that edges in our hasse
H A DGAPlcellorder4 ## <=_L on the group. What we output is the hasse diagram of this ordering
13 ## the (reversed) left cell ordering, in the sense that edges in our hasse
H A DGAPlcorder4 ## <=_L on the group. What we output is the hasse diagram of this ordering
13 ## the (reversed) left cell ordering, in the sense that edges in our hasse
H A DGAPlrcorder4 ## <=_LR on the group. What we output is the hasse diagram of this ordering
13 ## the (reversed) two-sided cell ordering, in the sense that edges in our hasse
H A DGAPlrcellorder4 ## <=_LR on the group. What we output is the hasse diagram of this ordering
13 ## the (reversed) two-sided cell ordering, in the sense that edges in our hasse
H A DGAPrcorder4 ## <=_R on the group. What we output is the hasse diagram of this ordering
13 ## the (reversed) right cell ordering, in the sense that edges in our hasse
H A Dterse_lcellorder3 # preorder relation <=_L on the group. What we output is the hasse diagram
12 # the (reversed) left cell ordering, in the sense that edges in our hasse
H A Dterse_lcorder3 # preorder relation <=_L on the group. What we output is the hasse diagram
12 # the (reversed) left cell ordering, in the sense that edges in our hasse
H A Dterse_lrcellorder3 # preorder relation <=_LR on the group. What we output is the hasse diagram
12 # the (reversed) two-sided cell ordering, in the sense that edges in our hasse
H A Dterse_rcellorder3 # preorder relation <=_R on the group. What we output is the hasse diagram
12 # the (reversed) right cell ordering, in the sense that edges in our hasse
H A Dterse_rcorder3 # preorder relation <=_R on the group. What we output is the hasse diagram
12 # the (reversed) right cell ordering, in the sense that edges in our hasse
H A Dterse_lrcorder3 # preorder relation <=_LR on the group. What we output is the hasse diagram
12 # the (reversed) two-sided cell ordering, in the sense that edges in our hasse
/dports/math/gap/gap-4.11.0/pkg/OpenMath-11.5.0/hasse/
H A Dhasse.g3 #W hasse/hasse.g OpenMath Package Andrew Solomon
/dports/math/gap/gap-4.11.0/pkg/hapcryst-0.1.13/
H A Dinit.g6 #ReadPackage("HAPcryst","lib/hasse.gd");
/dports/math/pari/pari-2.13.3/src/functions/algebras/
H A Dalghassei5 Help: alghassei(al): the hasse invariant of the central simple algebra al
H A Dalghasse5 Help: alghasse(al,pl): the hasse invariant of the central simple algebra al at

12345