/dports/math/gap/gap-4.11.0/pkg/hapcryst-0.1.13/lib/ |
H A D | FaceLatticeAndBoundaryBieberbachGroup.gi | 109 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 D | resolutionBieberbach.gi | 64 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 D | servent.t | 9 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 D | servent.t | 9 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 D | servent.t | 9 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 D | servent.t | 9 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 D | lie-hasse.cwl | 1 # 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 D | hasse_diagram_reformat.gi | 2 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 D | init.g | 129 ReadPackage("openmath", "/hasse/config.g"); 130 ReadPackage("openmath", "/hasse/hasse.g");
|
/dports/math/coxeter3/coxeter-7b5a1f0/headers/ |
H A D | GAPrcellorder | 4 ## <=_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 D | GAPlcellorder | 4 ## <=_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 D | GAPlcorder | 4 ## <=_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 D | GAPlrcorder | 4 ## <=_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 D | GAPlrcellorder | 4 ## <=_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 D | GAPrcorder | 4 ## <=_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 D | terse_lcellorder | 3 # 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 D | terse_lcorder | 3 # 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 D | terse_lrcellorder | 3 # 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 D | terse_rcellorder | 3 # 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 D | terse_rcorder | 3 # 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 D | terse_lrcorder | 3 # 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 D | hasse.g | 3 #W hasse/hasse.g OpenMath Package Andrew Solomon
|
/dports/math/gap/gap-4.11.0/pkg/hapcryst-0.1.13/ |
H A D | init.g | 6 #ReadPackage("HAPcryst","lib/hasse.gd");
|
/dports/math/pari/pari-2.13.3/src/functions/algebras/ |
H A D | alghassei | 5 Help: alghassei(al): the hasse invariant of the central simple algebra al
|
H A D | alghasse | 5 Help: alghasse(al,pl): the hasse invariant of the central simple algebra al at
|