/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/tests/ |
H A D | tut-CoCoLA4.cocoa5 | 60 NewS := [ ideal(ReducedGBasis(J + L)) | L in LinFac ]; 73 NewS := concat(NewS, [ ideal(ReducedGBasis(J + L)) | L in LinFac ]); 86 NewS := concat(NewS, [ ideal(ReducedGBasis(J + L)) | L in LinFac ]); 170 NewS := [ ideal(ReducedGBasis(J + ideal(f))) | f in EF ]; 180 RGB := ReducedGBasis(J); indent(RGB); 221 NewS := [ ideal(ReducedGBasis(J + L)) | L in RealFac ]; 234 NewS := concat(NewS, [ ideal(ReducedGBasis(J + L)) | L in RealFac ]); 247 NewS := concat(NewS, [ ideal(ReducedGBasis(J + L)) | L in RealFac ]);
|
H A D | whatiscocoa.cocoa5 | 21 ReducedGBasis(PolySystem); 45 ReducedGBasis(A + B + C); 57 ReducedGBasis(I);
|
H A D | lecture-HF4.cocoa5 | 134 PrimitiveSeparatedBinomials := [ B in ReducedGBasis(T) | gcd(LT(B), PW) = 1]; 199 PrimitiveSeparatedBinomials := [ B in ReducedGBasis(T) | gcd(LT(B),W) = 1]; 254 PrimitiveSeparatedBinomials := [ B in ReducedGBasis(T) | gcd(LT(B), PW) = 1];
|
H A D | demo-GeMiTo2011.cocoa5 | 37 RGB := ReducedGBasis(ideal(Psi(G1), Psi(G2)));
|
H A D | demo-Osaka2015.cocoa5 | 34 /**/ ReducedGBasis(ideal(x, dx)); --> [1]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/tests/ |
H A D | tut-CoCoLA4.cocoa5 | 60 NewS := [ ideal(ReducedGBasis(J + L)) | L in LinFac ]; 73 NewS := concat(NewS, [ ideal(ReducedGBasis(J + L)) | L in LinFac ]); 86 NewS := concat(NewS, [ ideal(ReducedGBasis(J + L)) | L in LinFac ]); 170 NewS := [ ideal(ReducedGBasis(J + ideal(f))) | f in EF ]; 180 RGB := ReducedGBasis(J); indent(RGB); 221 NewS := [ ideal(ReducedGBasis(J + L)) | L in RealFac ]; 234 NewS := concat(NewS, [ ideal(ReducedGBasis(J + L)) | L in RealFac ]); 247 NewS := concat(NewS, [ ideal(ReducedGBasis(J + L)) | L in RealFac ]);
|
H A D | whatiscocoa.cocoa5 | 21 ReducedGBasis(PolySystem); 45 ReducedGBasis(A + B + C); 57 ReducedGBasis(I);
|
H A D | lecture-HF4.cocoa5 | 134 PrimitiveSeparatedBinomials := [ B in ReducedGBasis(T) | gcd(LT(B), PW) = 1]; 199 PrimitiveSeparatedBinomials := [ B in ReducedGBasis(T) | gcd(LT(B),W) = 1]; 254 PrimitiveSeparatedBinomials := [ B in ReducedGBasis(T) | gcd(LT(B), PW) = 1];
|
H A D | demo-GeMiTo2011.cocoa5 | 37 RGB := ReducedGBasis(ideal(Psi(G1), Psi(G2)));
|
H A D | demo-Osaka2015.cocoa5 | 34 /**/ ReducedGBasis(ideal(x, dx)); --> [1]
|
/dports/math/giacxcas/CoCoALib-0.99700/src/CoCoA-5/packages/ |
H A D | GroebnerFan.cpkg5 | 101 RGB := ReducedGBasis(I); 117 -- L:=MarkedPolynomialsToInequalitiesPositiveOrthant(ReducedGBasis(I)); 125 L := MarkedPolynomialsToInequalitiesPositiveOrthant(ReducedGBasis(I)); 230 println "ReducedGBasis: \t", DecimalStr($.GlobalTime9); 266 println "ReducedGBasis: \t", DecimalStr($.GlobalTime9); 285 return [ ReducedGBasis(J) | J in GroebnerFanIdeals(I) ]; 296 …return MakeSet(flatten([apply(PolyAlgebraHom(RingOf(J),R,indets(R)),ReducedGBasis(J)) | J in GF])… 306 L := [ monic(phi(f)) | f in ReducedGBasis(J) and not(monic(phi(f)) IsIn UGB) ];
|
H A D | PrimaryDecompositionGTZ0.cpkg5 | 136 GBasisPhiI := ReducedGBasis(PhiI); 147 Primary := ideal(ReducedGBasis(PhiI+ideal(f))); 155 primary:=ideal(ReducedGBasis(I_ + ideal(PhiInv(f)))), 156 prime:=ideal(ReducedGBasis(ideal(apply(PhiInv,gens(Prime)))))]);
|
H A D | NotBuiltin.cpkg5 | 27 Export ReducedGBasis; 362 Define ReducedGBasis(I) 365 EndDefine; -- ReducedGBasis
|
H A D | OperationCommunication.cpkg5 | 57 -- -- ReducedGBasis(M); 114 "ReducedGBasis", "VerbosityLevel"]; 140 -- If "ReducedGBasis" IsIn UndefFlds Then Info.ReducedGBasis := False; EndIf; 784 Info5.ReducedGBasis := True;
|
/dports/math/cocoalib/CoCoALib-0.99712/src/CoCoA-5/packages/ |
H A D | GroebnerFan.cpkg5 | 101 RGB := ReducedGBasis(I); 117 -- L:=MarkedPolynomialsToInequalitiesPositiveOrthant(ReducedGBasis(I)); 125 L := MarkedPolynomialsToInequalitiesPositiveOrthant(ReducedGBasis(I)); 230 println "ReducedGBasis: \t", DecimalStr($.GlobalTime9); 266 println "ReducedGBasis: \t", DecimalStr($.GlobalTime9); 285 return [ ReducedGBasis(J) | J in GroebnerFanIdeals(I) ]; 296 …return MakeSet(flatten([apply(PolyAlgebraHom(RingOf(J),R,indets(R)),ReducedGBasis(J)) | J in GF])… 306 L := [ monic(phi(f)) | f in ReducedGBasis(J) and not(monic(phi(f)) IsIn UGB) ];
|
H A D | PrimaryDecompositionGTZ0.cpkg5 | 136 GBasisPhiI := ReducedGBasis(PhiI); 147 Primary := ideal(ReducedGBasis(PhiI+ideal(f))); 155 primary:=ideal(ReducedGBasis(I_ + ideal(PhiInv(f)))), 156 prime:=ideal(ReducedGBasis(ideal(apply(PhiInv,gens(Prime)))))]);
|
H A D | NotBuiltin.cpkg5 | 27 Export ReducedGBasis; 355 Define ReducedGBasis(I) 358 EndDefine; -- ReducedGBasis
|
/dports/math/cocoalib/CoCoALib-0.99712/src/AlgebraicCore/ |
H A D | HomomorphismOps.C | 281 const vector<RingElem> RGB = ReducedGBasis(RichPhi.idealRS); in KerRichHom() 301 vector<RingElem> RGBJ = ReducedGBasis(ideal(GensKer)); in KerRichHom() 325 const vector<RingElem> RGBh = ReducedGBasis(ideal(P_h,gensH)); in KerRichHom_H() 347 vector<RingElem> RGBhJ = ReducedGBasis(ideal(DomainPhi,GensKer)); in KerRichHom_H()
|
H A D | SparsePolyOps-ideal.C | 124 const std::vector<RingElem>& ReducedGBasis(const ideal& I) in ReducedGBasis() function 921 return CommonDenom(ReducedGBasis(I)); in DenSigma() 933 return !IsDivisible(CommonDenom(ReducedGBasis(I)), p); in IsSigmaGoodPrime() 945 return !IsDivisible(CommonDenom(ReducedGBasis(I)), p); in IsSigmaGoodPrime()
|
H A D | SparsePolyOps-RadicalMembership.C | 77 const vector<RingElem> ExtraGens = RadicalHelpers(ReducedGBasis(I)); in RabinovichTrick()
|
/dports/math/giacxcas/CoCoALib-0.99700/src/AlgebraicCore/ |
H A D | HomomorphismOps.C | 281 const vector<RingElem> RGB = ReducedGBasis(RichPhi.idealRS); in KerRichHom() 301 vector<RingElem> RGBJ = ReducedGBasis(ideal(GensKer)); in KerRichHom() 324 const vector<RingElem> RGBh = ReducedGBasis(ideal(gensH)); in KerRichHom_H() 346 vector<RingElem> RGBhJ = ReducedGBasis(ideal(GensKer)); in KerRichHom_H()
|
H A D | SparsePolyOps-ideal.C | 124 const std::vector<RingElem>& ReducedGBasis(const ideal& I) in ReducedGBasis() function 921 return CommonDenom(ReducedGBasis(I)); in DenSigma() 933 return !IsDivisible(CommonDenom(ReducedGBasis(I)), p); in IsSigmaGoodPrime() 945 return !IsDivisible(CommonDenom(ReducedGBasis(I)), p); in IsSigmaGoodPrime()
|
H A D | SparsePolyOps-RadicalMembership.C | 77 const vector<RingElem> ExtraGens = RadicalHelpers(ReducedGBasis(I)); in RabinovichTrick()
|
/dports/math/cocoalib/CoCoALib-0.99712/include/CoCoA/ |
H A D | SparsePolyOps-ideal.H | 44 const std::vector<RingElem>& ReducedGBasis(const ideal& I);
|
/dports/math/giacxcas/CoCoALib-0.99700/include/CoCoA/ |
H A D | SparsePolyOps-ideal.H | 44 const std::vector<RingElem>& ReducedGBasis(const ideal& I);
|