/dports/math/gap/gap-4.11.0/pkg/SmallGrp-1.4.1/gap/ |
H A D | smlgp1.g | 145 rels := [ gens[1]^p / gens[2], gens[2]^p / gens[3], gens[3]^p ]; 147 rels := [ gens[1]^p / gens[3], gens[2]^p, gens[3]^p ]; 149 rels := [ gens[1]^p, gens[2]^p, gens[3]^p, 152 rels := [ gens[1]^p/gens[3], gens[2]^p, gens[3]^p, 158 rels := [ gens[1]^p, gens[2]^p, gens[3]^p ]; 192 rels := [ gens[ 1 ] ^ p / gens[ 3 ] , gens[ 2 ] ^ q, gens[ 3 ] ^ p ]; 200 gens[ 3 ] ^ gens[ 1 ] / gens[ 2 ] * gens[ 3 ] ]; 247 rels := [ gens[ 1 ] ^ p, gens[ 2 ] ^ q / gens[ 3 ], gens[ 3 ] ^ q ]; 254 rels := [ gens[ 1 ] ^ p, gens[ 2 ] ^ q / gens[ 3 ], gens[ 3 ] ^ q, 264 Add( rels, gens[2]^gens[1] / ( gens[2]^vec[1] * gens[3]^vec[2] ) ); [all …]
|
/dports/math/4ti2/4ti2-Release_1_6_9/src/groebner/ |
H A D | SaturationGenSet.cpp | 57 VectorArray& gens, in compute() argument 78 gens.insert(basis); in compute() 79 gens.insert(feasible.get_ray()); in compute() 86 VectorArray& gens, in compute_bounded() argument 103 gens.insert(feasible.get_basis()); in compute_bounded() 110 saturate(gens, sat, urs); in compute_bounded() 133 saturate(gens, sat, urs); in compute_bounded() 214 const VectorArray& gens, in saturate_zero_columns() argument 249 const VectorArray& gens, in saturate() argument 269 useful.insert(gens[i]); in saturate() [all …]
|
H A D | MaxMinGenSet.cpp | 57 VectorArray& gens, in compute() argument 78 gens.insert(basis); in compute() 79 gens.insert(feasible.get_ray()); in compute() 86 VectorArray& gens, in compute_bounded() argument 103 gens.insert(feasible.get_basis()); in compute_bounded() 110 VectorArray ext_gens(gens.get_number(), gens.get_size()+1, 0); in compute_bounded() 111 VectorArray::lift(gens, 0, gens.get_size(), ext_gens); in compute_bounded() 115 ext_vec[gens.get_size()] = -1; in compute_bounded() 180 VectorArray::project(ext_gens, 0, gens.get_size(), gens); in compute_bounded() 218 saturate(gens, tmp_sat, urs); in compute_saturations() [all …]
|
H A D | GeneratingSet.cpp | 39 gens = 0; in GeneratingSet() 44 delete gens; in ~GeneratingSet() 52 gens = _gens; in GeneratingSet() 53 if (gens == 0) in GeneratingSet() 63 assert(gens != 0 && feasible != 0); in compute() 104 algorithm.compute(*feasible, *gens); in minimal() 110 assert(gens != 0 && feasible != 0); in standardise() 114 if ((*gens)[i] < zero) { (*gens)[i].mul(-1); } in standardise() 116 gens->sort(); in standardise() 122 assert(gens != 0); in get_generating_set() [all …]
|
H A D | HybridGenSet.cpp | 60 VectorArray& gens, in compute() argument 80 gens.insert(basis); in compute() 81 gens.insert(feasible.get_ray()); in compute() 88 VectorArray& gens, in compute_bounded() argument 119 add_support(gens, fin); in compute_bounded() 136 add_support(gens, fin); in compute_bounded() 162 const VectorArray& gens, in add_support() argument 184 const VectorArray& gens, in positive_count() argument 190 if (gens[r][c] > 0) ++count; in positive_count() 197 const VectorArray& gens, in next_support() argument [all …]
|
H A D | ProjectLiftGenSet.cpp | 60 VectorArray& gens, in compute() argument 72 VectorArray& gens, in compute_unbounded() argument 92 gens.insert(basis); in compute_unbounded() 93 gens.insert(feasible.get_ray()); in compute_unbounded() 102 VectorArray& gens, in compute_bounded() argument 143 add_support(gens, fin); in compute_bounded() 162 add_support(gens, fin); in compute_bounded() 182 const VectorArray& gens, in add_support() argument 204 const VectorArray& gens, in positive_count() argument 210 if (gens[r][c] > 0) ++count; in positive_count() [all …]
|
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/tst/standard/ |
H A D | factor.tst | 34 gap> gens := [ 48 gap> gens := [ 301 gap> EvaluateWord(gens, x[1]) = gens[1] and EvaluateWord(gens, x[3]) = gens[3]; 328 gap> gens := [gens[4], gens[1], gens[2], gens[5], gens[3]];; 449 gap> ForAll([1 .. Length(gens)], i -> EvaluateWord(gens, x[i]) = gens[i]); 530 gap> ForAll([1 .. Length(gens)], i -> EvaluateWord(gens, x[i]) = gens[i]); 539 gap> ForAll([1 .. Length(gens)], i -> EvaluateWord(gens, x[i]) = gens[i]); 558 gap> ForAll([1 .. Length(gens)], i -> EvaluateWord(gens, x[i]) = gens[i]); 566 gap> ForAll([1 .. Length(gens)], i -> EvaluateWord(gens, x[i]) = gens[i]); 588 gap> ForAll([1 .. Length(gens)], i -> EvaluateWord(gens, x[i]) = gens[i]); [all …]
|
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/tst/extreme/ |
H A D | closure.tst | 39 gap> gens := 91 gap> t := Semigroup(gens); 114 gap> t := Semigroup(gens); 183 gap> s := Monoid(gens[1], gens[2]); 222 gap> for x in gens do 271 gap> gens := 320 gap> gens := [ 366 > S := ClosureSemigroup(S, [gens[2 * i - 1], gens[2 * i]]); 380 gap> gens := [ 588 gap> s := Monoid(gens[1], gens[2]); [all …]
|
H A D | properties.tst | 157 gap> gens := [ 160 gap> s := Monoid(gens);; 214 gap> s := Monoid(gens);; 234 gap> s := Monoid(gens);; 257 gap> s := Monoid(gens);; 265 gap> s := Monoid(gens);; 272 gap> s := Monoid(gens);; 286 gap> gens := [ 366 gap> gens := [ 676 #gap> s:=Monoid(gens);; [all …]
|
/dports/math/libsemigroups/libsemigroups-1.3.7/tests/ |
H A D | test-froidure-pin-element.cpp | 210 y->redefine(gens[0], gens[1]); 213 y->redefine(gens[1], gens[2]); 250 y->redefine(gens[0], gens[0]); 314 x->redefine(gens[1], gens[1]); 357 x->redefine(gens[1], gens[1]); 395 x->redefine(gens[0], gens[0]); 440 x->redefine(gens[0], gens[0]); 479 x->redefine(gens[0], gens[0]); 518 x->redefine(gens[1], gens[0]); 2456 gens[0]->redefine(gens[3], gens[4]); [all …]
|
/dports/math/gap/gap-4.11.0/pkg/simpcomp/lib/ |
H A D | highlySymmetricSurfaces.gi | 563 gens:=[]; 1104 gens[2]:=[ 1, 2, 5 ]; 1105 gens[3]:=[ 1, 4, 17 ]; 1106 gens[4]:=[ 1, 7, 13 ]; 1107 gens[5]:=[ 1, 4, 7 ]; 1108 gens[6]:=[ 1, 2, 12 ]; 1109 gens[7]:=[ 1, 2, 6 ]; 1111 gens[9]:=[ 1, 2, 3 ]; 1113 gens[11]:=[ 1, 2, 4 ]; 1115 gens[13]:=[ 1, 2, 6 ]; [all …]
|
/dports/math/gap/gap-4.11.0/pkg/guarana-0.96.2/magma/ |
H A D | print.gi | 14 gens := Pcp( G ); 16 n := Length( gens ); 30 if gens[g]^rods[g] = gens[g]^0 then 42 conj := gens[h]^gens[g]; 47 gens[h]^gens[g], "\n" ); 50 gens[h]^gens[g], ",\n" ); 55 gens[h]^gens[g], ",\n" ); 57 gens[h]^(gens[g]^-1), "\n" ); 60 gens[h]^gens[g], ",\n" ); 61 AppendTo( file, " ", gens[h], "^", gens[g]^-1, " = ", [all …]
|
/dports/math/gap/gap-4.11.0/lib/ |
H A D | invsgp.gi | 70 gens := ShallowCopy(gens); 213 function(gens) 220 gens := AsList(gens); 222 if CanEasilyCompareElements(gens) and IsFinite(gens) 229 if Length(gens) = 1 then # Length(gens) <> 0 since One(gens) in gens 237 gens := ShallowCopy(gens); 243 gens := ShallowCopy(gens); 264 gens := AsList(gens); 270 pos := Position(gens, One(gens)); 273 if Length(gens) = 1 then # Length(gens) <> 0 since One(gens) in gens [all …]
|
H A D | monoid.gi | 66 #M MonoidByGenerators( <gens> ) . . . . . . . . monoid generated by <gens> 71 function(gens) 76 gens := AsList(gens); 78 if CanEasilyCompareElements(gens) and IsFinite(gens) 81 pos := Position(gens, One(gens)); 84 if Length(gens) = 1 then # Length(gens) <> 0 since One(gens) in gens 86 elif not IsPartialPermCollection(gens) or One(gens) = 92 gens := ShallowCopy(gens); 96 SetGeneratorsOfMagma(M, Concatenation([One(gens)], gens)); 164 local gens, pos; [all …]
|
H A D | addmagma.gi | 140 Error("usage: AdditiveMagma(<gens>), AdditiveMagma(<Fam>,<gens>)"); 146 #F SubadditiveMagma( <M>, <gens> ) add. submagma of <M> generated by <gens> 297 #F SubadditiveGroup( <M>, <gens> ) . . . add. subgroup of <M> gen. by <gens> 358 function( gens ) 377 if not ( IsEmpty(gens) or IsIdenticalObj( FamilyObj(gens), family ) ) then 395 function( gens ) 414 if not ( IsEmpty(gens) or IsIdenticalObj( FamilyObj(gens), family ) ) then 432 function( gens ) 647 if elm in gens 654 gens:= Concatenation( gens, [ elm ] ); [all …]
|
/dports/math/gap/gap-4.11.0/pkg/alnuth-3.1.2/gap/ |
H A D | present.gi | 28 #gens := gens{[i..n]}; 29 #gens := gens * normal.coltrans^-1; 32 gens := gens{[i..n]}; 33 return gens; 47 return rec( gens:=gens, 152 #gens := gens{[i..n]}; 153 #gens := gens * normal.coltrans^-1; 156 gens := gens{[i..n]}; 181 return rec( gens:=gens, 272 k:=Length(gens); [all …]
|
/dports/math/gap/gap-4.11.0/pkg/polenta-1.3.9/exam/ |
H A D | exam.gi | 18 local newGens, gens; 183 gens := 259 gens := 690 gens := 783 gens:=[]; 797 return gens; 838 gens := []; 935 gens := []; 943 return gens; 956 return gens; [all …]
|
/dports/math/gap/gap-4.11.0/pkg/semigroups-3.2.3/libsemigroups/tests/ |
H A D | test-froidure-pin-element.cpp | 212 y->redefine(gens[0], gens[1]); 215 y->redefine(gens[1], gens[2]); 252 y->redefine(gens[0], gens[0]); 316 x->redefine(gens[1], gens[1]); 359 x->redefine(gens[1], gens[1]); 397 x->redefine(gens[0], gens[0]); 442 x->redefine(gens[0], gens[0]); 481 x->redefine(gens[0], gens[0]); 520 x->redefine(gens[1], gens[0]); 2731 gens[0]->redefine(gens[3], gens[4]); [all …]
|
H A D | test-kbe.cpp | 31 void delete_gens(std::vector<TElementType>& gens) { in delete_gens() argument 32 for (auto& x : gens) { in delete_gens() 44 delete_gens(gens); 64 delete_gens(gens); 73 gens = {new KBE(kb, 0), new KBE(kb, 1)}; 76 delete_gens(gens); 94 delete_gens(gens); 125 delete_gens(gens); 141 delete_gens(gens); 162 delete_gens(gens); [all …]
|
/dports/math/py-sympy/sympy-1.9/sympy/polys/domains/ |
H A D | old_fractionfield.py | 23 if not gens: 26 lev = len(gens) - 1 33 self.symbols = self.gens = gens 58 num, _ = dict_from_basic(p, gens=self.gens) 59 den, _ = dict_from_basic(q, gens=self.gens) 95 if K1.gens == K0.gens: 101 monoms, coeffs = _dict_reorder(a.to_dict(), K0.gens, K1.gens) 128 if K1.gens == K0.gens: 134 elif set(K0.gens).issubset(K1.gens): 136 a.numer().to_dict(), K0.gens, K1.gens) [all …]
|
/dports/math/py-sympy/sympy-1.9/sympy/polys/ |
H A D | polyutils.py | 102 gens = sorted(gens, key=order_key) 106 return tuple(gens) 140 gens.extend(f_gens) 143 return tuple(gens) 148 if len(gens) == 1 and hasattr(gens[0], '__iter__'): 276 gens = _sort_gens(gens, opt=opt) 308 return poly, gens 314 return poly, gens 331 if opt.gens: 367 if opt.gens: [all …]
|
/dports/math/gap/gap-4.11.0/pkg/recog-1.3.2/examples/ |
H A D | a14wrs5mat.g | 3 gens := AtlasGenerators("A14",11).generators; 5 Add(l,CVEC_GlueMatrices([gens[1],gens[1]^0,gens[1]^0,gens[1]^0,gens[1]^0])); 6 Add(l,CVEC_GlueMatrices([gens[2],gens[1]^0,gens[1]^0,gens[1]^0,gens[1]^0])); 7 Add(l,KroneckerProduct(PermutationMat((1,2,3,4,5),5,GF(3)),gens[1]^0)); 8 Add(l,KroneckerProduct(PermutationMat((1,2),5,GF(3)),gens[1]^0));
|
/dports/sysutils/webmin/webmin-1.981/sendmail/ |
H A D | list_generics.cgi | 31 @gens = &list_generics($gfile); 33 @gens = grep { $_->{'from'} =~ /$access{'oaddrs'}/i || 34 $_->{'to'} =~ /$access{'oaddrs'}/i } @gens; 41 @gens = grep { $_->{'from'} =~ /$in{'search'}/ } @gens; 49 undef(@gens); 52 if (@gens) { 55 @gens = sort sort_by_domain @gens; 64 $mid = int((@gens+1)/2); 66 &gens_table(@gens[0..$mid-1]); 68 if ($mid < @gens) { &gens_table(@gens[$mid..$#gens]); } [all …]
|
/dports/math/gap/gap-4.11.0/tst/testinstall/ |
H A D | straight.tst | 12 gap> gens:= GeneratorsOfGroup( f );; 14 gap> ResultOfStraightLineProgram( prg0, gens ); 17 gap> ResultOfStraightLineProgram( prg1, gens ); 20 gap> ResultOfStraightLineProgram( prg2, gens ); 24 gap> ResultOfStraightLineProgram( prg3, gens ); 29 gap> ResultOfStraightLineProgram( prg, gens ); 32 gap> ResultOfStraightLineProgram( prg, gens ); 35 gap> ResultOfStraightLineProgram( prg, gens ); 38 gap> ResultOfStraightLineProgram( prg, gens ); 41 gap> ResultOfStraightLineProgram( prg, gens ); [all …]
|
/dports/math/py-Diofant/Diofant-0.13.0/diofant/polys/ |
H A D | polytools.py | 85 obj.gens = gens 116 gens = opt.gens 137 gens = opt.gens 163 gens = opt.gens 168 if gens and rep.gens != gens: 322 gens = gens[:remove] + gens[remove + 1:] 346 gens = self.gens 349 gens = gens[:remove] + gens[remove + 1:] 738 gens = self.gens argument 2348 if f.gens != g.gens: [all …]
|